./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sqm.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sqm.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 950fd5ff5cc9d2c5e3d846192e43f4963ef3abd0ec7056eb5d764989d48b2064 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:20:28,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:20:28,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:20:28,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:20:28,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:20:28,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:20:28,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:20:28,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:20:28,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:20:28,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:20:28,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:20:28,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:20:28,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:20:28,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:20:28,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:20:28,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:20:28,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:20:28,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:20:28,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:20:28,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:20:28,952 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:20:28,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:20:28,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:20:28,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:20:28,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:20:28,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:20:28,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:20:28,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:20:28,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:20:28,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:20:28,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:20:28,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:20:28,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:20:28,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:20:28,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:20:28,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:20:28,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:20:28,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:20:28,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:20:28,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:20:28,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:20:28,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:20:28,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:20:28,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:20:28,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:20:28,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:20:28,996 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:20:28,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:20:28,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:20:28,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:20:28,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:20:28,999 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:20:29,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:20:29,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:20:29,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:20:29,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:20:29,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:20:29,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:20:29,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:20:29,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:20:29,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:20:29,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:20:29,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:20:29,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:20:29,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:20:29,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:20:29,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:20:29,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:20:29,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:20:29,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:20:29,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:20:29,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:20:29,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:20:29,005 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:20:29,005 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:20:29,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:20:29,005 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 -> 950fd5ff5cc9d2c5e3d846192e43f4963ef3abd0ec7056eb5d764989d48b2064 [2022-07-13 11:20:29,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:20:29,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:20:29,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:20:29,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:20:29,192 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:20:29,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sqm.c [2022-07-13 11:20:29,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c26aad/7e85ddee12b34b768377e192c2c88821/FLAGc178c994a [2022-07-13 11:20:29,592 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:20:29,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sqm.c [2022-07-13 11:20:29,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c26aad/7e85ddee12b34b768377e192c2c88821/FLAGc178c994a [2022-07-13 11:20:29,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c26aad/7e85ddee12b34b768377e192c2c88821 [2022-07-13 11:20:29,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:20:29,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:20:29,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:20:29,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:20:29,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:20:29,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3e2ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29, skipping insertion in model container [2022-07-13 11:20:29,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:20:29,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:20:29,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sqm.c[586,599] [2022-07-13 11:20:29,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:20:29,787 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:20:29,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sqm.c[586,599] [2022-07-13 11:20:29,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:20:29,823 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:20:29,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29 WrapperNode [2022-07-13 11:20:29,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:20:29,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:20:29,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:20:29,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:20:29,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,861 INFO L137 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-07-13 11:20:29,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:20:29,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:20:29,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:20:29,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:20:29,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,872 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:20:29,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:20:29,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:20:29,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:20:29,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (1/1) ... [2022-07-13 11:20:29,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:20:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:29,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:20:29,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:20:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:20:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:20:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:20:29,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:20:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:20:29,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:20:29,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:20:30,004 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:20:30,005 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:20:30,099 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:20:30,103 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:20:30,103 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 11:20:30,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:20:30 BoogieIcfgContainer [2022-07-13 11:20:30,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:20:30,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:20:30,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:20:30,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:20:30,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:20:29" (1/3) ... [2022-07-13 11:20:30,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d15ed03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:20:30, skipping insertion in model container [2022-07-13 11:20:30,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:20:29" (2/3) ... [2022-07-13 11:20:30,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d15ed03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:20:30, skipping insertion in model container [2022-07-13 11:20:30,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:20:30" (3/3) ... [2022-07-13 11:20:30,111 INFO L111 eAbstractionObserver]: Analyzing ICFG sqm.c [2022-07-13 11:20:30,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:20:30,121 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:20:30,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:20:30,157 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@424c08d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@706cf917 [2022-07-13 11:20:30,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:20:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 11:20:30,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:30,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:30,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:30,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-07-13 11:20:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:30,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056688171] [2022-07-13 11:20:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:30,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:30,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056688171] [2022-07-13 11:20:30,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056688171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:20:30,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:20:30,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:20:30,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097393957] [2022-07-13 11:20:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:20:30,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:20:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:20:30,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:20:30,292 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:30,301 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-07-13 11:20:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:20:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 11:20:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:30,307 INFO L225 Difference]: With dead ends: 38 [2022-07-13 11:20:30,307 INFO L226 Difference]: Without dead ends: 17 [2022-07-13 11:20:30,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:20:30,312 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:30,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:20:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-13 11:20:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-13 11:20:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-13 11:20:30,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-07-13 11:20:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:30,337 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-13 11:20:30,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-13 11:20:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 11:20:30,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:30,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:30,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:20:30,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-07-13 11:20:30,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:30,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046625804] [2022-07-13 11:20:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:30,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:30,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:30,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711272498] [2022-07-13 11:20:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:30,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:30,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:30,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:30,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:20:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:30,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:20:30,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:30,542 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 11:20:30,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-13 11:20:30,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:20:30,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:20:30,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-13 11:20:30,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 11:20:30,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:30,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:20:30,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046625804] [2022-07-13 11:20:30,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:30,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711272498] [2022-07-13 11:20:30,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711272498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:20:30,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:20:30,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:20:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058193589] [2022-07-13 11:20:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:20:30,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:20:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:30,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:20:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:20:30,865 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:30,935 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-13 11:20:30,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:20:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 11:20:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:30,937 INFO L225 Difference]: With dead ends: 34 [2022-07-13 11:20:30,937 INFO L226 Difference]: Without dead ends: 32 [2022-07-13 11:20:30,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:20:30,939 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:30,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:20:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-13 11:20:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-13 11:20:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 11:20:30,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-07-13 11:20:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:30,953 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 11:20:30,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:30,954 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 11:20:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:20:30,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:30,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:30,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:31,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:31,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2022-07-13 11:20:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:31,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667540611] [2022-07-13 11:20:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:31,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:31,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039003928] [2022-07-13 11:20:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:31,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:31,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:20:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:31,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:20:31,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:31,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:20:31,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:31,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667540611] [2022-07-13 11:20:31,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:31,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039003928] [2022-07-13 11:20:31,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039003928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:20:31,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:20:31,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:20:31,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394310409] [2022-07-13 11:20:31,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:20:31,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:20:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:20:31,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:20:31,298 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:31,348 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-07-13 11:20:31,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:20:31,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-07-13 11:20:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:31,350 INFO L225 Difference]: With dead ends: 49 [2022-07-13 11:20:31,350 INFO L226 Difference]: Without dead ends: 40 [2022-07-13 11:20:31,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:20:31,353 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:31,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:20:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-13 11:20:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-07-13 11:20:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-13 11:20:31,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-13 11:20:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:31,368 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-13 11:20:31,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-13 11:20:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 11:20:31,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:31,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:31,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:31,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 11:20:31,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2022-07-13 11:20:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:31,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404696121] [2022-07-13 11:20:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:31,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:31,604 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:31,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504621188] [2022-07-13 11:20:31,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:31,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:31,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:31,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:31,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:20:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:31,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 11:20:31,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:31,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:31,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:31,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404696121] [2022-07-13 11:20:31,695 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:31,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504621188] [2022-07-13 11:20:31,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504621188] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:31,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:20:31,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-07-13 11:20:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17036147] [2022-07-13 11:20:31,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:31,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:20:31,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:31,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:20:31,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:20:31,697 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:31,767 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-13 11:20:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:20:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 14 [2022-07-13 11:20:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:31,768 INFO L225 Difference]: With dead ends: 44 [2022-07-13 11:20:31,769 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 11:20:31,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:20:31,769 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:31,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 46 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:20:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 11:20:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2022-07-13 11:20:31,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-13 11:20:31,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-07-13 11:20:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:31,773 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-13 11:20:31,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-13 11:20:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:20:31,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:31,774 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:31,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:31,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2022-07-13 11:20:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503599262] [2022-07-13 11:20:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:32,000 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:32,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107563801] [2022-07-13 11:20:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:32,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:32,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:32,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:32,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:20:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:32,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:20:32,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:32,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:20:32,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503599262] [2022-07-13 11:20:32,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:32,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107563801] [2022-07-13 11:20:32,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107563801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:20:32,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:20:32,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:20:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107564441] [2022-07-13 11:20:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:20:32,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:20:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:20:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:20:32,085 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:32,160 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-07-13 11:20:32,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:20:32,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:20:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:32,161 INFO L225 Difference]: With dead ends: 41 [2022-07-13 11:20:32,161 INFO L226 Difference]: Without dead ends: 27 [2022-07-13 11:20:32,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:20:32,162 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:32,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:20:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-13 11:20:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-07-13 11:20:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-13 11:20:32,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-07-13 11:20:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:32,164 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-13 11:20:32,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-13 11:20:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:20:32,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:32,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:32,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:32,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:32,365 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-07-13 11:20:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:32,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939785255] [2022-07-13 11:20:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:32,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:32,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572766761] [2022-07-13 11:20:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:32,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:32,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:32,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:32,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:20:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:32,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 11:20:32,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:32,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:20:32,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:32,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 11:20:32,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:20:32,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:20:32,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:32,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 11:20:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:32,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:32,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_147 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-13 11:20:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 11:20:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:32,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939785255] [2022-07-13 11:20:32,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:32,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572766761] [2022-07-13 11:20:32,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572766761] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:32,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:20:32,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-13 11:20:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798077302] [2022-07-13 11:20:32,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:32,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:20:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:20:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=64, Unknown=1, NotChecked=16, Total=110 [2022-07-13 11:20:32,714 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:32,820 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-13 11:20:32,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:20:32,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:20:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:32,821 INFO L225 Difference]: With dead ends: 44 [2022-07-13 11:20:32,821 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 11:20:32,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=109, Unknown=1, NotChecked=22, Total=182 [2022-07-13 11:20:32,821 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:32,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 107 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-07-13 11:20:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 11:20:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2022-07-13 11:20:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-13 11:20:32,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2022-07-13 11:20:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:32,825 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-13 11:20:32,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-13 11:20:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:20:32,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:32,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:32,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:33,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:33,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:33,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:33,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1267903976, now seen corresponding path program 2 times [2022-07-13 11:20:33,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:33,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399039456] [2022-07-13 11:20:33,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:33,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:33,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:33,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763212482] [2022-07-13 11:20:33,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:20:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:33,064 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:33,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 11:20:33,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:20:33,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:20:33,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:20:33,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:33,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:33,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:33,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399039456] [2022-07-13 11:20:33,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:33,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763212482] [2022-07-13 11:20:33,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763212482] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:33,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:20:33,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:20:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687012735] [2022-07-13 11:20:33,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:20:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:33,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:20:33,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:20:33,176 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:33,264 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-13 11:20:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:20:33,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 11:20:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:33,265 INFO L225 Difference]: With dead ends: 61 [2022-07-13 11:20:33,265 INFO L226 Difference]: Without dead ends: 52 [2022-07-13 11:20:33,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:20:33,266 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:33,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 37 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:20:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-13 11:20:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-07-13 11:20:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-13 11:20:33,270 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2022-07-13 11:20:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:33,270 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-13 11:20:33,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-13 11:20:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 11:20:33,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:33,271 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:33,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:33,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:33,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1174519208, now seen corresponding path program 3 times [2022-07-13 11:20:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:33,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470520495] [2022-07-13 11:20:33,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:33,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:33,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728707201] [2022-07-13 11:20:33,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:20:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:33,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:33,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 11:20:33,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 11:20:33,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:20:33,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:20:33,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:33,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:33,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470520495] [2022-07-13 11:20:33,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:33,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728707201] [2022-07-13 11:20:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728707201] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:33,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:20:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-13 11:20:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503293698] [2022-07-13 11:20:33,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:33,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:20:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:20:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:20:33,622 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:20:33,728 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-07-13 11:20:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:20:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-13 11:20:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:20:33,729 INFO L225 Difference]: With dead ends: 56 [2022-07-13 11:20:33,729 INFO L226 Difference]: Without dead ends: 49 [2022-07-13 11:20:33,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:20:33,730 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:20:33,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:20:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-13 11:20:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-07-13 11:20:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-13 11:20:33,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2022-07-13 11:20:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:20:33,733 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-13 11:20:33,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:20:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-13 11:20:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:20:33,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:20:33,734 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:20:33,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 11:20:33,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:33,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:20:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:20:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2022-07-13 11:20:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:20:33,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719892718] [2022-07-13 11:20:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:20:33,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:20:33,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927465814] [2022-07-13 11:20:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:20:33,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:20:33,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:20:33,964 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:20:33,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 11:20:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:20:34,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-13 11:20:34,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:20:34,056 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-13 11:20:34,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-07-13 11:20:34,074 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-07-13 11:20:34,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2022-07-13 11:20:34,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:20:34,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:20:34,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2022-07-13 11:20:34,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 11:20:34,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:20:34,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:34,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-13 11:20:34,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:20:34,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-07-13 11:20:34,429 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-13 11:20:34,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 35 [2022-07-13 11:20:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:34,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:20:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:20:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:20:35,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719892718] [2022-07-13 11:20:35,060 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:20:35,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927465814] [2022-07-13 11:20:35,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927465814] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:20:35,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:20:35,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-13 11:20:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560209469] [2022-07-13 11:20:35,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:20:35,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 11:20:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:20:35,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 11:20:35,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:20:35,062 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:21:02,628 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-13 11:21:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:21:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 11:21:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:21:02,629 INFO L225 Difference]: With dead ends: 76 [2022-07-13 11:21:02,629 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 11:21:02,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=170, Invalid=531, Unknown=1, NotChecked=0, Total=702 [2022-07-13 11:21:02,630 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 105 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:21:02,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 117 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 141 Invalid, 0 Unknown, 35 Unchecked, 0.3s Time] [2022-07-13 11:21:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 11:21:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 45. [2022-07-13 11:21:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-13 11:21:02,635 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-07-13 11:21:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:21:02,635 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-13 11:21:02,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:21:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-13 11:21:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 11:21:02,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:21:02,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:21:02,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 11:21:02,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-13 11:21:02,852 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:21:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:21:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1786143722, now seen corresponding path program 4 times [2022-07-13 11:21:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:21:02,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486298070] [2022-07-13 11:21:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:21:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:21:02,866 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:21:02,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018734481] [2022-07-13 11:21:02,873 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:21:02,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:21:02,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:21:02,874 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:21:02,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 11:21:03,018 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:21:03,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:21:03,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-13 11:21:03,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:21:03,040 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-13 11:21:03,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-13 11:21:03,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:21:03,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:21:03,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:21:03,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2022-07-13 11:21:03,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 11:21:03,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:21:03,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-07-13 11:21:03,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 11:21:03,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:21:03,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-13 11:21:03,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:21:03,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 11:21:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:21:03,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:21:03,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-07-13 11:21:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-13 11:21:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:21:03,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486298070] [2022-07-13 11:21:03,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:21:03,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018734481] [2022-07-13 11:21:03,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018734481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:21:03,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:21:03,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2022-07-13 11:21:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494592869] [2022-07-13 11:21:03,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:21:03,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:21:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:21:03,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:21:03,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=146, Unknown=2, NotChecked=26, Total=240 [2022-07-13 11:21:03,463 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:22:02,338 WARN L233 SmtUtils]: Spent 58.68s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:22:15,468 WARN L233 SmtUtils]: Spent 13.11s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 11:22:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:22:15,546 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-07-13 11:22:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 11:22:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 11:22:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:22:15,547 INFO L225 Difference]: With dead ends: 93 [2022-07-13 11:22:15,547 INFO L226 Difference]: Without dead ends: 91 [2022-07-13 11:22:15,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 72.1s TimeCoverageRelationStatistics Valid=197, Invalid=557, Unknown=6, NotChecked=52, Total=812 [2022-07-13 11:22:15,548 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 122 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:22:15,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 103 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 88 Invalid, 0 Unknown, 165 Unchecked, 0.1s Time] [2022-07-13 11:22:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-13 11:22:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 45. [2022-07-13 11:22:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:22:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-13 11:22:15,553 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 20 [2022-07-13 11:22:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:22:15,553 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-13 11:22:15,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:22:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-13 11:22:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:22:15,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:22:15,554 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:22:15,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 11:22:15,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 11:22:15,768 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:22:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:22:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1197174726, now seen corresponding path program 2 times [2022-07-13 11:22:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:22:15,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299081119] [2022-07-13 11:22:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:22:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:22:15,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:22:15,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323532738] [2022-07-13 11:22:15,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:22:15,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:22:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:22:15,782 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:22:15,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 11:22:15,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 11:22:15,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:22:15,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 11:22:15,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:22:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:22:15,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:22:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:22:15,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:22:15,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299081119] [2022-07-13 11:22:15,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:22:15,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323532738] [2022-07-13 11:22:15,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323532738] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:22:15,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:22:15,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-07-13 11:22:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151593715] [2022-07-13 11:22:15,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:22:15,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:22:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:22:15,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:22:15,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:22:15,951 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:22:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:22:16,057 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-07-13 11:22:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:22:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:22:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:22:16,058 INFO L225 Difference]: With dead ends: 76 [2022-07-13 11:22:16,058 INFO L226 Difference]: Without dead ends: 56 [2022-07-13 11:22:16,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:22:16,059 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:22:16,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 58 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:22:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-13 11:22:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2022-07-13 11:22:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 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) [2022-07-13 11:22:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-13 11:22:16,064 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2022-07-13 11:22:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:22:16,064 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-13 11:22:16,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:22:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-13 11:22:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:22:16,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:22:16,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:22:16,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 11:22:16,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 11:22:16,279 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:22:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:22:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -900609774, now seen corresponding path program 5 times [2022-07-13 11:22:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:22:16,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920836750] [2022-07-13 11:22:16,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:22:16,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:22:16,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:22:16,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477623903] [2022-07-13 11:22:16,313 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:22:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:22:16,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:22:16,318 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:22:16,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 11:23:19,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-13 11:23:19,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:23:19,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:23:19,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:23:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:23:19,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:23:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:23:19,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:23:19,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920836750] [2022-07-13 11:23:19,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:23:19,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477623903] [2022-07-13 11:23:19,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477623903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:23:19,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:23:19,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-13 11:23:19,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446360373] [2022-07-13 11:23:19,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:23:19,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:23:19,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:23:19,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:23:19,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:23:19,271 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:23:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:23:19,393 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-07-13 11:23:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:23:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 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 24 [2022-07-13 11:23:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:23:19,394 INFO L225 Difference]: With dead ends: 86 [2022-07-13 11:23:19,394 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 11:23:19,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:23:19,394 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:23:19,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 59 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:23:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 11:23:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2022-07-13 11:23:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:23:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-07-13 11:23:19,399 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2022-07-13 11:23:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:23:19,399 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-07-13 11:23:19,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:23:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-07-13 11:23:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 11:23:19,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:23:19,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:23:19,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 11:23:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 11:23:19,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:23:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:23:19,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 6 times [2022-07-13 11:23:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:23:19,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200459905] [2022-07-13 11:23:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:23:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:23:19,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:23:19,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865422273] [2022-07-13 11:23:19,633 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 11:23:19,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:23:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:23:19,635 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) [2022-07-13 11:23:19,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 11:23:20,247 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-13 11:23:20,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:23:20,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 11:23:20,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:23:20,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:23:20,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 11:23:20,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:23:20,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:23:20,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:23:20,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 11:23:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 11:23:20,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2022-07-13 11:23:20,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,521 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-13 11:23:20,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2022-07-13 11:23:20,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,563 INFO L356 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-07-13 11:23:20,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 11 [2022-07-13 11:23:20,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2022-07-13 11:23:20,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,654 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-13 11:23:20,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 105 [2022-07-13 11:23:20,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:20,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2022-07-13 11:23:24,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-07-13 11:23:24,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:24,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:23:24,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-13 11:23:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:23:24,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:23:27,201 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) is different from false [2022-07-13 11:23:29,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647))))) (not .cse2)) (or (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse4 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4 1)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0))))) .cse2))) is different from false [2022-07-13 11:23:31,438 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0))))) is different from false [2022-07-13 11:23:49,059 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (= (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (<= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) is different from false [2022-07-13 11:23:49,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:23:49,129 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-13 11:23:49,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:23:49,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-07-13 11:23:49,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:23:49,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:23:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-13 11:23:49,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:23:49,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200459905] [2022-07-13 11:23:49,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:23:49,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865422273] [2022-07-13 11:23:49,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865422273] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:23:49,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:23:49,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2022-07-13 11:23:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764965176] [2022-07-13 11:23:49,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:23:49,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 11:23:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:23:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 11:23:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=665, Unknown=14, NotChecked=236, Total=1122 [2022-07-13 11:23:49,146 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:23:50,152 WARN L833 $PredicateComparison]: unable to prove that (and (= 2 (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 2147483647) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| (+ c_~N~0 1))) is different from false [2022-07-13 11:23:55,736 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~N~0 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 3 c_~N~0)) is different from false [2022-07-13 11:23:56,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (<= c_~N~0 4) (or (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647))))) (not .cse2)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 3 c_~N~0) (or (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse4 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse4 1)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0))))) .cse2) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-13 11:23:57,994 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse0 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse0 1)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))) (<= c_~N~0 4) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse1 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse1 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< 3 c_~N~0)) is different from false [2022-07-13 11:24:00,004 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse3 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3) c_~N~0) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse3 1)) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (<= |aux_mod_ULTIMATE.start_main_~i~0#1_45| 2147483647) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))))) (.cse1 (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_45| Int) (|aux_mod_ULTIMATE.start_main_~i~0#1_45| Int)) (let ((.cse2 (* |aux_div_ULTIMATE.start_main_~i~0#1_45| 4294967296))) (or (< (+ 2 |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2) c_~N~0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~i~0#1_45|) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_441) (+ (* (mod |aux_mod_ULTIMATE.start_main_~i~0#1_45| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* (mod (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= c_~N~0 (+ |aux_mod_ULTIMATE.start_main_~i~0#1_45| .cse2 1)) (< |aux_mod_ULTIMATE.start_main_~i~0#1_45| 0)))))) (and (or (and .cse0 .cse1) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) .cse0 .cse1)) is different from false [2022-07-13 11:24:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:00,159 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-07-13 11:24:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 11:24:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 11:24:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:00,160 INFO L225 Difference]: With dead ends: 78 [2022-07-13 11:24:00,160 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 11:24:00,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=266, Invalid=938, Unknown=22, NotChecked=666, Total=1892 [2022-07-13 11:24:00,161 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:00,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 112 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 153 Invalid, 0 Unknown, 422 Unchecked, 0.1s Time] [2022-07-13 11:24:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 11:24:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-07-13 11:24:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-07-13 11:24:00,169 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 24 [2022-07-13 11:24:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:00,169 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-07-13 11:24:00,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-07-13 11:24:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-13 11:24:00,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:00,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:00,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:00,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 11:24:00,372 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:00,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash 149788298, now seen corresponding path program 3 times [2022-07-13 11:24:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:00,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543972016] [2022-07-13 11:24:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:00,396 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:24:00,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881173191] [2022-07-13 11:24:00,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 11:24:00,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:00,398 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) [2022-07-13 11:24:00,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 11:24:00,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 11:24:00,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:00,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:24:00,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:24:00,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:24:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543972016] [2022-07-13 11:24:00,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:24:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881173191] [2022-07-13 11:24:00,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881173191] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:00,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:24:00,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-13 11:24:00,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983851385] [2022-07-13 11:24:00,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:00,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:24:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:00,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:24:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:24:00,665 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:00,857 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2022-07-13 11:24:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 11:24:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 26 [2022-07-13 11:24:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:00,858 INFO L225 Difference]: With dead ends: 98 [2022-07-13 11:24:00,858 INFO L226 Difference]: Without dead ends: 89 [2022-07-13 11:24:00,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-07-13 11:24:00,859 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 41 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:00,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 76 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:24:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-13 11:24:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-07-13 11:24:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-07-13 11:24:00,867 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 26 [2022-07-13 11:24:00,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:00,867 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-07-13 11:24:00,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:24:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-07-13 11:24:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:24:00,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:00,868 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:00,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 11:24:01,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 11:24:01,080 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash -55017726, now seen corresponding path program 4 times [2022-07-13 11:24:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:01,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794990082] [2022-07-13 11:24:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:01,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:24:01,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991693780] [2022-07-13 11:24:01,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 11:24:01,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:01,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:01,097 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:24:01,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 11:24:01,304 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 11:24:01,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:24:01,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 11:24:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:24:01,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:24:01,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 11:24:01,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:24:01,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-13 11:24:01,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 109 [2022-07-13 11:24:01,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:24:01,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-07-13 11:24:01,399 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:24:01,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2022-07-13 11:24:01,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 139 [2022-07-13 11:24:01,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:24:01,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 199 [2022-07-13 11:24:01,617 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-13 11:24:01,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:24:01,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:24:01,732 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 11:24:01,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 58 [2022-07-13 11:24:01,982 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-13 11:24:01,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 48 [2022-07-13 11:24:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:01,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:24:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:24:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:24:11,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794990082] [2022-07-13 11:24:11,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 11:24:11,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991693780] [2022-07-13 11:24:11,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991693780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:24:11,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:24:11,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-07-13 11:24:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422603260] [2022-07-13 11:24:11,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 11:24:11,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 11:24:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:24:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 11:24:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2022-07-13 11:24:11,251 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 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) [2022-07-13 11:24:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:24:11,985 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-13 11:24:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 11:24:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 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 28 [2022-07-13 11:24:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:24:11,985 INFO L225 Difference]: With dead ends: 69 [2022-07-13 11:24:11,985 INFO L226 Difference]: Without dead ends: 67 [2022-07-13 11:24:11,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2022-07-13 11:24:11,986 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:24:11,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2022-07-13 11:24:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-13 11:24:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-13 11:24:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 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) [2022-07-13 11:24:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-07-13 11:24:11,994 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 28 [2022-07-13 11:24:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:24:11,995 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-07-13 11:24:11,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 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) [2022-07-13 11:24:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-07-13 11:24:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:24:11,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:24:11,996 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:24:12,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 11:24:12,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:12,205 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:24:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:24:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 48972360, now seen corresponding path program 5 times [2022-07-13 11:24:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:24:12,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097700705] [2022-07-13 11:24:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:24:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:24:12,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 11:24:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125688244] [2022-07-13 11:24:12,230 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 11:24:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:24:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:24:12,231 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:24:12,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 11:25:06,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-13 11:25:06,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:25:06,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 11:25:06,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:25:06,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 11:25:06,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-13 11:25:06,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-13 11:25:06,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:25:06,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 11:25:06,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-13 11:25:06,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-13 11:25:06,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-13 11:25:06,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 129 [2022-07-13 11:25:06,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:25:06,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 196 [2022-07-13 11:25:06,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 58 [2022-07-13 11:25:06,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 11:25:06,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2022-07-13 11:25:06,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 11:25:06,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2022-07-13 11:25:06,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2022-07-13 11:25:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:25:06,750 INFO L328 TraceCheckSpWp]: Computing backward predicates...