./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/loops/eureka_01-1.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 a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:45:29,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:45:29,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:45:29,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:45:29,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:45:29,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:45:29,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:45:29,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:45:29,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:45:29,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:45:29,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:45:29,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:45:29,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:45:29,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:45:29,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:45:29,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:45:29,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:45:29,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:45:29,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:45:29,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:45:29,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:45:29,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:45:29,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:45:29,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:45:29,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:45:29,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:45:29,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:45:29,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:45:29,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:45:29,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:45:29,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:45:29,895 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:45:29,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:45:29,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:45:29,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:45:29,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:45:29,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:45:29,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:45:29,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:45:29,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:45:29,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:45:29,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:45:29,917 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:45:29,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:45:29,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:45:29,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:45:29,920 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:45:29,920 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:45:29,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:45:29,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:45:29,921 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:45:29,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:45:29,922 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:45:29,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:45:29,922 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:45:29,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:45:29,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:45:29,923 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:45:29,923 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:45:29,923 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:45:29,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:45:29,923 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:45:29,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:45:29,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:45:29,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:45:29,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:45:29,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:45:29,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:45:29,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:45:29,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:45:29,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:45:29,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:45:29,925 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:45:29,925 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:45:29,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:45:29,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:45:29,925 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 -> a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 [2021-12-14 13:45:30,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:45:30,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:45:30,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:45:30,146 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:45:30,146 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:45:30,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-1.c [2021-12-14 13:45:30,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0f30e44/b095e83de9eb4e59950cc6da87aca8af/FLAGab69b8bff [2021-12-14 13:45:30,537 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:45:30,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2021-12-14 13:45:30,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0f30e44/b095e83de9eb4e59950cc6da87aca8af/FLAGab69b8bff [2021-12-14 13:45:30,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0f30e44/b095e83de9eb4e59950cc6da87aca8af [2021-12-14 13:45:30,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:45:30,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:45:30,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:45:30,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:45:30,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:45:30,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3659e059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30, skipping insertion in model container [2021-12-14 13:45:30,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:45:30,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:45:30,710 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/loops/eureka_01-1.c[446,459] [2021-12-14 13:45:30,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:45:30,755 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:45:30,766 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/loops/eureka_01-1.c[446,459] [2021-12-14 13:45:30,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:45:30,801 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:45:30,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30 WrapperNode [2021-12-14 13:45:30,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:45:30,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:45:30,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:45:30,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:45:30,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,846 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2021-12-14 13:45:30,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:45:30,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:45:30,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:45:30,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:45:30,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:45:30,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:45:30,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:45:30,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:45:30,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (1/1) ... [2021-12-14 13:45:30,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:45:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:30,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:45:30,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 13:45:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:45:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:45:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:45:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:45:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:45:30,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:45:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:45:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:45:31,022 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:45:31,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:45:31,235 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:45:31,239 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:45:31,239 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 13:45:31,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:45:31 BoogieIcfgContainer [2021-12-14 13:45:31,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:45:31,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:45:31,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:45:31,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:45:31,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:45:30" (1/3) ... [2021-12-14 13:45:31,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b65b21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:45:31, skipping insertion in model container [2021-12-14 13:45:31,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:45:30" (2/3) ... [2021-12-14 13:45:31,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b65b21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:45:31, skipping insertion in model container [2021-12-14 13:45:31,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:45:31" (3/3) ... [2021-12-14 13:45:31,246 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2021-12-14 13:45:31,249 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:45:31,249 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:45:31,304 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:45:31,309 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:45:31,309 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:45:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 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) [2021-12-14 13:45:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 13:45:31,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:31,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:31,331 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2021-12-14 13:45:31,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078753620] [2021-12-14 13:45:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:31,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:31,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:31,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078753620] [2021-12-14 13:45:31,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078753620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:45:31,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:45:31,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:45:31,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729675343] [2021-12-14 13:45:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:45:31,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:45:31,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:31,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:45:31,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:45:31,635 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 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 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-12-14 13:45:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:31,750 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2021-12-14 13:45:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:45:31,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2021-12-14 13:45:31,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:31,765 INFO L225 Difference]: With dead ends: 89 [2021-12-14 13:45:31,774 INFO L226 Difference]: Without dead ends: 42 [2021-12-14 13:45:31,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:45:31,778 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:31,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-14 13:45:31,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2021-12-14 13:45:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2021-12-14 13:45:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-14 13:45:31,806 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2021-12-14 13:45:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:31,807 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-14 13:45:31,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2021-12-14 13:45:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-14 13:45:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:45:31,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:31,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:31,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:45:31,809 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:31,811 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2021-12-14 13:45:31,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:31,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899936875] [2021-12-14 13:45:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:31,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:32,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899936875] [2021-12-14 13:45:32,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899936875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586544056] [2021-12-14 13:45:32,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:32,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:32,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:45:32,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:45:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:32,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 13:45:32,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:32,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-14 13:45:32,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:45:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:32,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:32,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-14 13:45:32,367 INFO L388 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 26 treesize of output 24 [2021-12-14 13:45:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:32,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586544056] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:32,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:32,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-14 13:45:32,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304010090] [2021-12-14 13:45:32,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:32,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 13:45:32,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 13:45:32,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-14 13:45:32,393 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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) [2021-12-14 13:45:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:32,541 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2021-12-14 13:45:32,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 13:45:32,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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 19 [2021-12-14 13:45:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:32,543 INFO L225 Difference]: With dead ends: 84 [2021-12-14 13:45:32,543 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 13:45:32,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-14 13:45:32,544 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 75 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:32,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 13:45:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2021-12-14 13:45:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 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) [2021-12-14 13:45:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2021-12-14 13:45:32,550 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2021-12-14 13:45:32,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:32,551 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2021-12-14 13:45:32,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 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) [2021-12-14 13:45:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2021-12-14 13:45:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:45:32,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:32,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:32,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:32,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:32,771 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:32,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2021-12-14 13:45:32,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:32,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355372906] [2021-12-14 13:45:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:32,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:32,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:32,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355372906] [2021-12-14 13:45:32,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355372906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:45:32,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:45:32,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:45:32,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276537132] [2021-12-14 13:45:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:45:32,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:45:32,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:45:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:45:32,811 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2021-12-14 13:45:32,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:32,835 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2021-12-14 13:45:32,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:45:32,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) Word has length 19 [2021-12-14 13:45:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:32,836 INFO L225 Difference]: With dead ends: 66 [2021-12-14 13:45:32,837 INFO L226 Difference]: Without dead ends: 45 [2021-12-14 13:45:32,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:45:32,838 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:32,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:45:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-14 13:45:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2021-12-14 13:45:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 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) [2021-12-14 13:45:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2021-12-14 13:45:32,854 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2021-12-14 13:45:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:32,854 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2021-12-14 13:45:32,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2021-12-14 13:45:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2021-12-14 13:45:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:45:32,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:32,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:32,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:45:32,856 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2021-12-14 13:45:32,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411376184] [2021-12-14 13:45:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:32,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:32,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:32,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:32,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411376184] [2021-12-14 13:45:32,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411376184] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:32,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365514015] [2021-12-14 13:45:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:32,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:32,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:32,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:45:32,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:45:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:33,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:45:33,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:33,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:33,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365514015] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:33,087 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:33,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-14 13:45:33,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707832505] [2021-12-14 13:45:33,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:33,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 13:45:33,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:33,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 13:45:33,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:45:33,089 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2021-12-14 13:45:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:33,175 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2021-12-14 13:45:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:45:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 22 [2021-12-14 13:45:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:33,177 INFO L225 Difference]: With dead ends: 114 [2021-12-14 13:45:33,177 INFO L226 Difference]: Without dead ends: 86 [2021-12-14 13:45:33,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:45:33,178 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:33,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-14 13:45:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2021-12-14 13:45:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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) [2021-12-14 13:45:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2021-12-14 13:45:33,183 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2021-12-14 13:45:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:33,183 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2021-12-14 13:45:33,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2021-12-14 13:45:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2021-12-14 13:45:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:45:33,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:33,184 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:33,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:33,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-14 13:45:33,399 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2021-12-14 13:45:33,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:33,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566411726] [2021-12-14 13:45:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:33,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:33,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:33,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566411726] [2021-12-14 13:45:33,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566411726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:33,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789780262] [2021-12-14 13:45:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:33,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:33,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:33,444 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) [2021-12-14 13:45:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:45:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:33,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 13:45:33,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:33,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:33,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789780262] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:33,603 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:33,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 13:45:33,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697223420] [2021-12-14 13:45:33,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:33,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:45:33,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:45:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:45:33,604 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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) [2021-12-14 13:45:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:33,741 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2021-12-14 13:45:33,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:45:33,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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 22 [2021-12-14 13:45:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:33,742 INFO L225 Difference]: With dead ends: 181 [2021-12-14 13:45:33,742 INFO L226 Difference]: Without dead ends: 159 [2021-12-14 13:45:33,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-14 13:45:33,743 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 164 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:33,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 155 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-14 13:45:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2021-12-14 13:45:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 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) [2021-12-14 13:45:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2021-12-14 13:45:33,750 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2021-12-14 13:45:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:33,750 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2021-12-14 13:45:33,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 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) [2021-12-14 13:45:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2021-12-14 13:45:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:45:33,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:33,752 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:33,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:33,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:33,968 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2021-12-14 13:45:33,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:33,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660592069] [2021-12-14 13:45:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:33,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:34,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:34,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660592069] [2021-12-14 13:45:34,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660592069] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:34,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802330395] [2021-12-14 13:45:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:34,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:34,017 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) [2021-12-14 13:45:34,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:45:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:34,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 13:45:34,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:34,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:34,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802330395] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:34,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:34,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 13:45:34,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058260437] [2021-12-14 13:45:34,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:34,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:45:34,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:34,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:45:34,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:45:34,202 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2021-12-14 13:45:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:34,285 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2021-12-14 13:45:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:45:34,285 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 23 [2021-12-14 13:45:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:34,286 INFO L225 Difference]: With dead ends: 206 [2021-12-14 13:45:34,286 INFO L226 Difference]: Without dead ends: 146 [2021-12-14 13:45:34,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:45:34,287 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:34,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-14 13:45:34,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2021-12-14 13:45:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 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) [2021-12-14 13:45:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2021-12-14 13:45:34,294 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2021-12-14 13:45:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:34,294 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2021-12-14 13:45:34,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2021-12-14 13:45:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2021-12-14 13:45:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:45:34,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:34,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:34,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:34,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:34,511 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:34,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2021-12-14 13:45:34,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:34,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860464304] [2021-12-14 13:45:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:34,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:34,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860464304] [2021-12-14 13:45:34,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860464304] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206077594] [2021-12-14 13:45:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:34,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:34,789 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) [2021-12-14 13:45:34,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:45:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:34,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-14 13:45:34,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:34,877 INFO L388 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 54 treesize of output 50 [2021-12-14 13:45:34,926 INFO L388 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 18 [2021-12-14 13:45:35,037 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:45:35,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2021-12-14 13:45:35,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 13:45:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:35,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:37,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-14 13:45:37,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) is different from false [2021-12-14 13:45:44,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-12-14 13:45:44,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206077594] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:44,963 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:44,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-12-14 13:45:44,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991762653] [2021-12-14 13:45:44,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:44,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 13:45:44,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:44,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 13:45:44,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=368, Unknown=4, NotChecked=82, Total=552 [2021-12-14 13:45:44,965 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) [2021-12-14 13:45:45,277 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-14 13:45:45,568 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-14 13:45:47,578 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_11| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_11| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1)) is different from false [2021-12-14 13:45:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:47,682 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2021-12-14 13:45:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 13:45:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) Word has length 25 [2021-12-14 13:45:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:47,683 INFO L225 Difference]: With dead ends: 112 [2021-12-14 13:45:47,683 INFO L226 Difference]: Without dead ends: 100 [2021-12-14 13:45:47,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=141, Invalid=522, Unknown=7, NotChecked=260, Total=930 [2021-12-14 13:45:47,684 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:47,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 200 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2021-12-14 13:45:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-14 13:45:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-12-14 13:45:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 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) [2021-12-14 13:45:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2021-12-14 13:45:47,691 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 25 [2021-12-14 13:45:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:47,691 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2021-12-14 13:45:47,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) [2021-12-14 13:45:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2021-12-14 13:45:47,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:45:47,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:47,692 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:47,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:47,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:47,908 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2021-12-14 13:45:47,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144830274] [2021-12-14 13:45:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:47,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:45:47,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:47,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144830274] [2021-12-14 13:45:47,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144830274] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:47,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072644396] [2021-12-14 13:45:47,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:45:47,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:47,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:47,993 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) [2021-12-14 13:45:48,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:45:48,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:45:48,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:48,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 13:45:48,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:48,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 13:45:48,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:48,124 INFO L388 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 29 [2021-12-14 13:45:48,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:45:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:45:48,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:50,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_66| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_66| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2021-12-14 13:45:50,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-14 13:45:50,323 INFO L388 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 68 treesize of output 66 [2021-12-14 13:45:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2021-12-14 13:45:50,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072644396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:50,368 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:50,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2021-12-14 13:45:50,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115365697] [2021-12-14 13:45:50,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:50,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 13:45:50,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:50,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 13:45:50,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2021-12-14 13:45:50,370 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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) [2021-12-14 13:45:52,393 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~#distance~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_66| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_66| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))))) is different from false [2021-12-14 13:45:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:52,574 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2021-12-14 13:45:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 13:45:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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) Word has length 25 [2021-12-14 13:45:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:52,576 INFO L225 Difference]: With dead ends: 145 [2021-12-14 13:45:52,576 INFO L226 Difference]: Without dead ends: 143 [2021-12-14 13:45:52,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=113, Invalid=313, Unknown=2, NotChecked=78, Total=506 [2021-12-14 13:45:52,577 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:52,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 172 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 242 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2021-12-14 13:45:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-14 13:45:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2021-12-14 13:45:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 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) [2021-12-14 13:45:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2021-12-14 13:45:52,583 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 25 [2021-12-14 13:45:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:52,583 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2021-12-14 13:45:52,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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) [2021-12-14 13:45:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2021-12-14 13:45:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:45:52,584 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:52,584 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:52,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:52,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:52,799 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2021-12-14 13:45:52,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:52,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337274154] [2021-12-14 13:45:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:52,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:52,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:52,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337274154] [2021-12-14 13:45:52,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337274154] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:52,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105077713] [2021-12-14 13:45:52,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:45:52,853 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:52,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:52,854 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) [2021-12-14 13:45:52,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:45:52,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:45:52,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:52,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 13:45:52,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:52,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:45:53,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105077713] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:53,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:53,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-14 13:45:53,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539919775] [2021-12-14 13:45:53,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:53,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 13:45:53,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 13:45:53,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-14 13:45:53,035 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) [2021-12-14 13:45:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:53,159 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2021-12-14 13:45:53,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:45:53,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) Word has length 28 [2021-12-14 13:45:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:53,161 INFO L225 Difference]: With dead ends: 183 [2021-12-14 13:45:53,162 INFO L226 Difference]: Without dead ends: 170 [2021-12-14 13:45:53,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-12-14 13:45:53,163 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 122 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:53,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 178 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:45:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-14 13:45:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2021-12-14 13:45:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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) [2021-12-14 13:45:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2021-12-14 13:45:53,172 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2021-12-14 13:45:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:53,173 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2021-12-14 13:45:53,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 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) [2021-12-14 13:45:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2021-12-14 13:45:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 13:45:53,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:53,177 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:53,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-14 13:45:53,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:53,393 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 160714710, now seen corresponding path program 2 times [2021-12-14 13:45:53,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:53,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808012446] [2021-12-14 13:45:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:53,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:45:53,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:53,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808012446] [2021-12-14 13:45:53,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808012446] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:53,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529066346] [2021-12-14 13:45:53,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:45:53,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:53,469 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) [2021-12-14 13:45:53,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:45:53,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:45:53,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:53,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:45:53,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:45:53,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 13:45:53,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529066346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:45:53,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 13:45:53,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-14 13:45:53,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098091963] [2021-12-14 13:45:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:45:53,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:45:53,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:53,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:45:53,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:45:53,603 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) [2021-12-14 13:45:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:53,638 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2021-12-14 13:45:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:45:53,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 29 [2021-12-14 13:45:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:53,639 INFO L225 Difference]: With dead ends: 213 [2021-12-14 13:45:53,639 INFO L226 Difference]: Without dead ends: 130 [2021-12-14 13:45:53,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:45:53,640 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:53,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:45:53,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-14 13:45:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-12-14 13:45:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 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) [2021-12-14 13:45:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2021-12-14 13:45:53,646 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 29 [2021-12-14 13:45:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:53,647 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2021-12-14 13:45:53,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2021-12-14 13:45:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2021-12-14 13:45:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 13:45:53,647 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:53,648 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:53,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 13:45:53,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 13:45:53,865 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:53,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2021-12-14 13:45:53,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:53,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430340995] [2021-12-14 13:45:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:53,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:45:53,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430340995] [2021-12-14 13:45:53,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430340995] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415854311] [2021-12-14 13:45:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:53,985 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:53,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:53,986 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) [2021-12-14 13:45:53,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 13:45:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:54,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 13:45:54,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:54,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 13:45:54,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 13:45:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:45:54,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:54,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-14 13:45:54,257 INFO L388 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 32 treesize of output 28 [2021-12-14 13:45:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:45:54,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415854311] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:54,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:54,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2021-12-14 13:45:54,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713269267] [2021-12-14 13:45:54,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:54,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 13:45:54,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 13:45:54,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-14 13:45:54,322 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 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) [2021-12-14 13:45:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:54,648 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2021-12-14 13:45:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 13:45:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 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 29 [2021-12-14 13:45:54,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:54,650 INFO L225 Difference]: With dead ends: 185 [2021-12-14 13:45:54,650 INFO L226 Difference]: Without dead ends: 183 [2021-12-14 13:45:54,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2021-12-14 13:45:54,650 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 251 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:54,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 224 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:45:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-14 13:45:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2021-12-14 13:45:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.26890756302521) internal successors, (151), 119 states have internal predecessors, (151), 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) [2021-12-14 13:45:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2021-12-14 13:45:54,657 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 29 [2021-12-14 13:45:54,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:54,657 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2021-12-14 13:45:54,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 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) [2021-12-14 13:45:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2021-12-14 13:45:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 13:45:54,658 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:54,658 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:54,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:54,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:54,858 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:54,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2021-12-14 13:45:54,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:54,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987372375] [2021-12-14 13:45:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:54,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:55,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987372375] [2021-12-14 13:45:55,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987372375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:55,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046041661] [2021-12-14 13:45:55,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:45:55,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:55,452 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) [2021-12-14 13:45:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 13:45:55,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 13:45:55,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:55,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 13:45:55,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:55,577 INFO L388 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 18 treesize of output 16 [2021-12-14 13:45:55,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:55,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:55,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:55,641 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:45:55,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2021-12-14 13:45:55,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:45:55,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:55,876 INFO L354 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2021-12-14 13:45:55,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 73 [2021-12-14 13:45:56,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:56,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:56,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:56,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:56,046 INFO L354 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2021-12-14 13:45:56,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 63 treesize of output 84 [2021-12-14 13:45:57,027 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:57,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2021-12-14 13:45:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:57,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:46:12,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4)) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) is different from false [2021-12-14 13:46:14,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 Int) (|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_410))) (or (< v_ArrVal_410 0) (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-14 13:46:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 13:46:14,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046041661] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:46:14,547 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:46:14,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 47 [2021-12-14 13:46:14,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482422847] [2021-12-14 13:46:14,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:46:14,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-14 13:46:14,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:46:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-14 13:46:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1643, Unknown=8, NotChecked=174, Total=2162 [2021-12-14 13:46:14,549 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 47 states have internal predecessors, (84), 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) [2021-12-14 13:46:15,142 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (forall ((|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (<= 0 (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4)) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-14 13:46:15,675 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select .cse0 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 76)) 4) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0) (= (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse1 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (forall ((|v_ULTIMATE.start_main_~x~0#1_22| Int) (|v_ULTIMATE.start_main_~j~0#1_33| Int) (v_ArrVal_415 Int) (v_ArrVal_413 Int)) (or (<= |v_ULTIMATE.start_main_~j~0#1_33| 0) (< 1 |v_ULTIMATE.start_main_~j~0#1_33|) (<= 0 (select (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_22| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_413))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_33| 4))) 4)) v_ArrVal_415)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_22| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)))) is different from false [2021-12-14 13:46:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:46:16,403 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2021-12-14 13:46:16,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 13:46:16,403 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 47 states have internal predecessors, (84), 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 31 [2021-12-14 13:46:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:46:16,404 INFO L225 Difference]: With dead ends: 149 [2021-12-14 13:46:16,405 INFO L226 Difference]: Without dead ends: 129 [2021-12-14 13:46:16,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=629, Invalid=2799, Unknown=10, NotChecked=468, Total=3906 [2021-12-14 13:46:16,406 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 66 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:46:16,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 254 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 148 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2021-12-14 13:46:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-14 13:46:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2021-12-14 13:46:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 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) [2021-12-14 13:46:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2021-12-14 13:46:16,413 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 31 [2021-12-14 13:46:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:46:16,414 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2021-12-14 13:46:16,414 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 47 states have internal predecessors, (84), 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) [2021-12-14 13:46:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2021-12-14 13:46:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 13:46:16,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:46:16,414 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:46:16,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 13:46:16,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 13:46:16,624 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:46:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:46:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2021-12-14 13:46:16,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:46:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053349153] [2021-12-14 13:46:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:46:16,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:46:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:46:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-14 13:46:16,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:46:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053349153] [2021-12-14 13:46:16,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053349153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:46:16,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:46:16,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 13:46:16,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729430748] [2021-12-14 13:46:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:46:16,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 13:46:16,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:46:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 13:46:16,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:46:16,653 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) [2021-12-14 13:46:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:46:16,674 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2021-12-14 13:46:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:46:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) Word has length 31 [2021-12-14 13:46:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:46:16,675 INFO L225 Difference]: With dead ends: 202 [2021-12-14 13:46:16,675 INFO L226 Difference]: Without dead ends: 146 [2021-12-14 13:46:16,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:46:16,676 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:46:16,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:46:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-14 13:46:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2021-12-14 13:46:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.264) internal successors, (158), 125 states have internal predecessors, (158), 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) [2021-12-14 13:46:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2021-12-14 13:46:16,684 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 31 [2021-12-14 13:46:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:46:16,684 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2021-12-14 13:46:16,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) [2021-12-14 13:46:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2021-12-14 13:46:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 13:46:16,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:46:16,685 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:46:16,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 13:46:16,685 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:46:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:46:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2021-12-14 13:46:16,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:46:16,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602331449] [2021-12-14 13:46:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:46:16,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:46:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:46:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:46:16,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:46:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602331449] [2021-12-14 13:46:16,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602331449] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:46:16,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838014463] [2021-12-14 13:46:16,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:46:16,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:46:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:46:16,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) [2021-12-14 13:46:16,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 13:46:16,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:46:16,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:46:16,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 13:46:16,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:46:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:46:16,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:46:16,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:46:16,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838014463] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:46:16,956 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:46:16,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 13:46:16,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8989005] [2021-12-14 13:46:16,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:46:16,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:46:16,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:46:16,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:46:16,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:46:16,957 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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) [2021-12-14 13:46:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:46:17,140 INFO L93 Difference]: Finished difference Result 408 states and 511 transitions. [2021-12-14 13:46:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 13:46:17,140 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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 33 [2021-12-14 13:46:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:46:17,142 INFO L225 Difference]: With dead ends: 408 [2021-12-14 13:46:17,142 INFO L226 Difference]: Without dead ends: 303 [2021-12-14 13:46:17,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-12-14 13:46:17,144 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 266 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:46:17,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 161 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:46:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-14 13:46:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 209. [2021-12-14 13:46:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 208 states have internal predecessors, (267), 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) [2021-12-14 13:46:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2021-12-14 13:46:17,157 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 267 transitions. Word has length 33 [2021-12-14 13:46:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:46:17,157 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 267 transitions. [2021-12-14 13:46:17,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 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) [2021-12-14 13:46:17,157 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 267 transitions. [2021-12-14 13:46:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 13:46:17,158 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:46:17,158 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:46:17,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 13:46:17,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 13:46:17,373 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:46:17,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:46:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2021-12-14 13:46:17,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:46:17,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924521534] [2021-12-14 13:46:17,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:46:17,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:46:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:46:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:46:17,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:46:17,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924521534] [2021-12-14 13:46:17,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924521534] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:46:17,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050025403] [2021-12-14 13:46:17,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 13:46:17,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:46:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:46:17,431 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:46:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 13:46:17,529 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 13:46:17,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:46:17,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 13:46:17,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:46:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:46:17,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:46:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:46:17,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050025403] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:46:17,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:46:17,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-14 13:46:17,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320351645] [2021-12-14 13:46:17,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:46:17,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 13:46:17,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:46:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 13:46:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-14 13:46:17,674 INFO L87 Difference]: Start difference. First operand 209 states and 267 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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) [2021-12-14 13:46:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:46:17,853 INFO L93 Difference]: Finished difference Result 492 states and 617 transitions. [2021-12-14 13:46:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 13:46:17,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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 34 [2021-12-14 13:46:17,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:46:17,855 INFO L225 Difference]: With dead ends: 492 [2021-12-14 13:46:17,855 INFO L226 Difference]: Without dead ends: 470 [2021-12-14 13:46:17,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2021-12-14 13:46:17,856 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 160 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:46:17,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 245 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:46:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-12-14 13:46:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 294. [2021-12-14 13:46:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.3139931740614335) internal successors, (385), 293 states have internal predecessors, (385), 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) [2021-12-14 13:46:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2021-12-14 13:46:17,871 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 34 [2021-12-14 13:46:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:46:17,872 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2021-12-14 13:46:17,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 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) [2021-12-14 13:46:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2021-12-14 13:46:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 13:46:17,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:46:17,873 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:46:17,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 13:46:18,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 13:46:18,079 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:46:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:46:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2021-12-14 13:46:18,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:46:18,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811245848] [2021-12-14 13:46:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:46:18,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:46:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:46:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:46:18,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:46:18,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811245848] [2021-12-14 13:46:18,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811245848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:46:18,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365768056] [2021-12-14 13:46:18,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:46:18,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:46:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:46:18,540 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:46:18,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 13:46:18,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:46:18,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:46:18,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-14 13:46:18,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:46:18,632 INFO L388 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 34 treesize of output 32 [2021-12-14 13:46:18,672 INFO L388 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 [2021-12-14 13:46:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:46:18,739 INFO L388 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 30 treesize of output 32 [2021-12-14 13:46:18,860 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:46:18,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2021-12-14 13:46:18,958 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 13:46:18,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2021-12-14 13:46:19,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 13:46:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 13:46:19,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:46:21,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (forall ((v_ArrVal_570 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-14 13:46:21,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2021-12-14 13:46:39,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_32| Int)) (or (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))))) is different from false [2021-12-14 13:46:40,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|))))) is different from false [2021-12-14 13:46:42,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_565 Int) (v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_565))) (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))))) is different from false [2021-12-14 13:46:44,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_124| Int)) (or (forall ((v_ArrVal_565 Int) (v_ArrVal_570 Int) (|v_ULTIMATE.start_main_~x~0#1_31| Int) (|v_ULTIMATE.start_main_~x~0#1_32| Int) (v_ArrVal_568 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_124| 4)) v_ArrVal_565))) (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_32| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_568))) (or (<= 0 (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_31| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_570) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_31| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1_32| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))))) (< |v_ULTIMATE.start_main_~i~0#1_124| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false