./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ifeqn5.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 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:43:29,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:43:29,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:43:29,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:43:29,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:43:29,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:43:29,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:43:29,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:43:29,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:43:29,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:43:29,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:43:29,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:43:29,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:43:29,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:43:29,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:43:29,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:43:29,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:43:29,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:43:29,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:43:29,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:43:29,075 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:43:29,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:43:29,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:43:29,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:43:29,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:43:29,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:43:29,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:43:29,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:43:29,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:43:29,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:43:29,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:43:29,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:43:29,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:43:29,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:43:29,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:43:29,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:43:29,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:43:29,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:43:29,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:43:29,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:43:29,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:43:29,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:43:29,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:43:29,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:43:29,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:43:29,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:43:29,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:43:29,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:43:29,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:43:29,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:43:29,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:43:29,113 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:43:29,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:43:29,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:43:29,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:43:29,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:43:29,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:43:29,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:43:29,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:43:29,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:43:29,116 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:43:29,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:43:29,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:43:29,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:43:29,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:43:29,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:43:29,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:43:29,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:43:29,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:43:29,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:43:29,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:43:29,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:43:29,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:43:29,119 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:43:29,119 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:43:29,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:43:29,119 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 -> 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 [2022-07-22 10:43:29,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:43:29,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:43:29,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:43:29,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:43:29,369 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:43:29,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn5.c [2022-07-22 10:43:29,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c535b996c/e80699fcbe374dd59d9e920668d176d3/FLAGebd970007 [2022-07-22 10:43:29,856 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:43:29,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c [2022-07-22 10:43:29,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c535b996c/e80699fcbe374dd59d9e920668d176d3/FLAGebd970007 [2022-07-22 10:43:30,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c535b996c/e80699fcbe374dd59d9e920668d176d3 [2022-07-22 10:43:30,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:43:30,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:43:30,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:43:30,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:43:30,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:43:30,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130cf21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30, skipping insertion in model container [2022-07-22 10:43:30,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:43:30,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:43:30,403 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/ifeqn5.c[589,602] [2022-07-22 10:43:30,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:43:30,427 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:43:30,441 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/ifeqn5.c[589,602] [2022-07-22 10:43:30,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:43:30,472 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:43:30,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30 WrapperNode [2022-07-22 10:43:30,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:43:30,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:43:30,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:43:30,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:43:30,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,506 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-07-22 10:43:30,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:43:30,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:43:30,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:43:30,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:43:30,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:43:30,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:43:30,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:43:30,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:43:30,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (1/1) ... [2022-07-22 10:43:30,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:43:30,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:30,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:43:30,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:43:30,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:43:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:43:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:43:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:43:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:43:30,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:43:30,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:43:30,679 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:43:30,680 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:43:30,805 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:43:30,810 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:43:30,811 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 10:43:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:43:30 BoogieIcfgContainer [2022-07-22 10:43:30,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:43:30,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:43:30,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:43:30,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:43:30,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:43:30" (1/3) ... [2022-07-22 10:43:30,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4985aa05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:43:30, skipping insertion in model container [2022-07-22 10:43:30,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:43:30" (2/3) ... [2022-07-22 10:43:30,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4985aa05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:43:30, skipping insertion in model container [2022-07-22 10:43:30,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:43:30" (3/3) ... [2022-07-22 10:43:30,825 INFO L111 eAbstractionObserver]: Analyzing ICFG ifeqn5.c [2022-07-22 10:43:30,839 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:43:30,840 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:43:30,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:43:30,889 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@72cf3f67, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73876070 [2022-07-22 10:43:30,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:43:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 10:43:30,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:30,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:30,910 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:30,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1670316217, now seen corresponding path program 1 times [2022-07-22 10:43:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:30,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729281337] [2022-07-22 10:43:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:31,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729281337] [2022-07-22 10:43:31,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729281337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:43:31,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:43:31,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:43:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771484150] [2022-07-22 10:43:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:43:31,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:43:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:43:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:43:31,146 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:31,163 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-07-22 10:43:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:43:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 10:43:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:31,173 INFO L225 Difference]: With dead ends: 42 [2022-07-22 10:43:31,173 INFO L226 Difference]: Without dead ends: 19 [2022-07-22 10:43:31,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:43:31,181 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:31,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:43:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-22 10:43:31,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-07-22 10:43:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-07-22 10:43:31,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-07-22 10:43:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:31,219 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 10:43:31,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-07-22 10:43:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 10:43:31,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:31,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:31,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:43:31,223 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1000416578, now seen corresponding path program 1 times [2022-07-22 10:43:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138027310] [2022-07-22 10:43:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:31,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138027310] [2022-07-22 10:43:31,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138027310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:43:31,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:43:31,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 10:43:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514906708] [2022-07-22 10:43:31,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:43:31,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 10:43:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 10:43:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:43:31,374 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:31,445 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-07-22 10:43:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 10:43:31,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 10:43:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:31,447 INFO L225 Difference]: With dead ends: 45 [2022-07-22 10:43:31,447 INFO L226 Difference]: Without dead ends: 31 [2022-07-22 10:43:31,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-22 10:43:31,448 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:31,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:43:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-22 10:43:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-07-22 10:43:31,468 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-22 10:43:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-22 10:43:31,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-07-22 10:43:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:31,469 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-22 10:43:31,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-22 10:43:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 10:43:31,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:31,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:31,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 10:43:31,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1992201947, now seen corresponding path program 1 times [2022-07-22 10:43:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:31,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864607096] [2022-07-22 10:43:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:31,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:31,498 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:31,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [13795223] [2022-07-22 10:43:31,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:31,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:31,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:43:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:31,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 10:43:31,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:31,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:43:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:43:31,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:43:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:31,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864607096] [2022-07-22 10:43:31,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:31,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13795223] [2022-07-22 10:43:31,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13795223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:43:31,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:43:31,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 10:43:31,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575693960] [2022-07-22 10:43:31,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:43:31,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 10:43:31,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 10:43:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:43:31,753 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:31,830 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-22 10:43:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 10:43:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 10:43:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:31,832 INFO L225 Difference]: With dead ends: 40 [2022-07-22 10:43:31,832 INFO L226 Difference]: Without dead ends: 38 [2022-07-22 10:43:31,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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-22 10:43:31,834 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:31,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:43:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-22 10:43:31,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-07-22 10:43:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-07-22 10:43:31,840 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-07-22 10:43:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:31,841 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-07-22 10:43:31,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-07-22 10:43:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-22 10:43:31,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:31,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:31,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:32,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:32,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash 259417010, now seen corresponding path program 1 times [2022-07-22 10:43:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:32,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198736865] [2022-07-22 10:43:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:32,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:32,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2134234284] [2022-07-22 10:43:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:32,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:32,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:32,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:32,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:43:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:32,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:43:32,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:32,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198736865] [2022-07-22 10:43:32,313 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134234284] [2022-07-22 10:43:32,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134234284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:32,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:32,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:43:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319571345] [2022-07-22 10:43:32,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:32,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:43:32,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:32,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:43:32,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:43:32,316 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-22 10:43:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:32,468 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-07-22 10:43:32,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:43:32,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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 21 [2022-07-22 10:43:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:32,469 INFO L225 Difference]: With dead ends: 70 [2022-07-22 10:43:32,469 INFO L226 Difference]: Without dead ends: 43 [2022-07-22 10:43:32,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:43:32,471 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:32,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:43:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-22 10:43:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-07-22 10:43:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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-22 10:43:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-22 10:43:32,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-07-22 10:43:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:32,477 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-22 10:43:32,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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-22 10:43:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-22 10:43:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:43:32,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:32,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:32,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:32,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 10:43:32,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 939318754, now seen corresponding path program 1 times [2022-07-22 10:43:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:32,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468993906] [2022-07-22 10:43:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:32,734 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:32,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750196848] [2022-07-22 10:43:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:32,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:32,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:32,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:43:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:32,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 10:43:32,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:32,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:43:32,878 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-22 10:43:32,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 10:43:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:43:32,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:33,095 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 21 treesize of output 19 [2022-07-22 10:43:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:43:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468993906] [2022-07-22 10:43:33,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:33,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750196848] [2022-07-22 10:43:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750196848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:33,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2022-07-22 10:43:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632051849] [2022-07-22 10:43:33,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:33,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 10:43:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 10:43:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-22 10:43:33,121 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:43:33,259 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-07-22 10:43:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 10:43:33,260 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-22 10:43:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:43:33,261 INFO L225 Difference]: With dead ends: 73 [2022-07-22 10:43:33,261 INFO L226 Difference]: Without dead ends: 61 [2022-07-22 10:43:33,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:43:33,262 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:43:33,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 80 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-07-22 10:43:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-22 10:43:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-07-22 10:43:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 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-22 10:43:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-07-22 10:43:33,270 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-07-22 10:43:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:43:33,271 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-07-22 10:43:33,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:43:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-07-22 10:43:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 10:43:33,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:43:33,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:43:33,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:43:33,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:33,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:43:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:43:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 430403928, now seen corresponding path program 1 times [2022-07-22 10:43:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:43:33,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308603016] [2022-07-22 10:43:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:43:33,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:43:33,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11370631] [2022-07-22 10:43:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:43:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:43:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:43:33,518 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:43:33,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:43:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:43:33,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-22 10:43:33,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:43:33,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:43:33,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:43:33,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:43:33,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 10:43:33,799 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-22 10:43:33,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:43:33,866 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:43:33,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2022-07-22 10:43:34,060 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 10:43:34,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-07-22 10:43:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:34,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:43:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:43:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:43:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308603016] [2022-07-22 10:43:34,747 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:43:34,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11370631] [2022-07-22 10:43:34,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11370631] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:43:34,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:43:34,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-07-22 10:43:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585009788] [2022-07-22 10:43:34,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:43:34,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 10:43:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:43:34,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 10:43:34,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-07-22 10:43:34,750 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 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-22 10:44:16,831 WARN L233 SmtUtils]: Spent 40.50s on a formula simplification. DAG size of input: 89 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:44:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:43,813 INFO L93 Difference]: Finished difference Result 124 states and 151 transitions. [2022-07-22 10:44:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 10:44:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 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-22 10:44:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:43,815 INFO L225 Difference]: With dead ends: 124 [2022-07-22 10:44:43,815 INFO L226 Difference]: Without dead ends: 93 [2022-07-22 10:44:43,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=248, Invalid=1082, Unknown=2, NotChecked=0, Total=1332 [2022-07-22 10:44:43,817 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:43,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 76 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 221 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2022-07-22 10:44:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-22 10:44:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2022-07-22 10:44:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-22 10:44:43,830 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 28 [2022-07-22 10:44:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:43,830 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-22 10:44:43,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 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-22 10:44:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-22 10:44:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:44:43,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:43,832 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:43,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 10:44:44,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:44,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:44,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -849177916, now seen corresponding path program 2 times [2022-07-22 10:44:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:44,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392661381] [2022-07-22 10:44:44,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:44,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:44,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:44,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564697526] [2022-07-22 10:44:44,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:44:44,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:44,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:44,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:44:44,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:44:44,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:44,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 10:44:44,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:44:44,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:44:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:44,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392661381] [2022-07-22 10:44:44,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:44,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564697526] [2022-07-22 10:44:44,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564697526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:44:44,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:44:44,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 10:44:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428668510] [2022-07-22 10:44:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:44:44,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 10:44:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 10:44:44,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:44:44,178 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-22 10:44:44,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:44,235 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-07-22 10:44:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 10:44:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) Word has length 30 [2022-07-22 10:44:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:44,236 INFO L225 Difference]: With dead ends: 121 [2022-07-22 10:44:44,237 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 10:44:44,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:44:44,238 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:44,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:44:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 10:44:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-07-22 10:44:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-07-22 10:44:44,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 30 [2022-07-22 10:44:44,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:44,248 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-07-22 10:44:44,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-22 10:44:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-07-22 10:44:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:44:44,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:44,249 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:44,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:44,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:44,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1242204926, now seen corresponding path program 3 times [2022-07-22 10:44:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:44,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795339045] [2022-07-22 10:44:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:44,503 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:44,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575495744] [2022-07-22 10:44:44,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:44:44,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:44,509 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:44,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:44:44,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:44:44,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:44,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 10:44:44,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:44,755 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:44:44,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 10:44:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:44,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795339045] [2022-07-22 10:44:44,883 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:44,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575495744] [2022-07-22 10:44:44,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575495744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:44,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:44,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-07-22 10:44:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696180843] [2022-07-22 10:44:44,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:44,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 10:44:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 10:44:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-22 10:44:44,885 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:45,182 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-22 10:44:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 10:44:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 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 30 [2022-07-22 10:44:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:45,184 INFO L225 Difference]: With dead ends: 133 [2022-07-22 10:44:45,184 INFO L226 Difference]: Without dead ends: 113 [2022-07-22 10:44:45,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:44:45,185 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 251 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:45,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 103 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:44:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-22 10:44:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2022-07-22 10:44:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-07-22 10:44:45,194 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2022-07-22 10:44:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:45,194 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-07-22 10:44:45,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-07-22 10:44:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:44:45,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:45,196 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:45,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:45,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:45,400 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 877615566, now seen corresponding path program 2 times [2022-07-22 10:44:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:45,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464921539] [2022-07-22 10:44:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:45,417 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:45,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833359204] [2022-07-22 10:44:45,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:44:45,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:45,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:45,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:44:45,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:44:45,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:45,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 10:44:45,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:44:45,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 10:44:45,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:45,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464921539] [2022-07-22 10:44:45,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:45,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833359204] [2022-07-22 10:44:45,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833359204] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:45,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:45,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-22 10:44:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873567166] [2022-07-22 10:44:45,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:45,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 10:44:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 10:44:45,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-22 10:44:45,645 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:45,802 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-07-22 10:44:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:44:45,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:44:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:45,803 INFO L225 Difference]: With dead ends: 102 [2022-07-22 10:44:45,803 INFO L226 Difference]: Without dead ends: 77 [2022-07-22 10:44:45,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-22 10:44:45,804 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:45,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 66 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:44:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-22 10:44:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-07-22 10:44:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-22 10:44:45,812 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 32 [2022-07-22 10:44:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:45,812 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-22 10:44:45,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-22 10:44:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-22 10:44:45,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:45,813 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:45,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:46,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:46,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1847758638, now seen corresponding path program 4 times [2022-07-22 10:44:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712194305] [2022-07-22 10:44:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:46,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:46,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752403407] [2022-07-22 10:44:46,063 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:44:46,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:46,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:46,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:46,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 10:44:46,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:44:46,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:46,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:44:46,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:44:46,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:44:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712194305] [2022-07-22 10:44:46,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752403407] [2022-07-22 10:44:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752403407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:46,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:46,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-22 10:44:46,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547218872] [2022-07-22 10:44:46,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:46,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 10:44:46,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 10:44:46,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:44:46,291 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:46,522 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-07-22 10:44:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 10:44:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-22 10:44:46,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:46,525 INFO L225 Difference]: With dead ends: 116 [2022-07-22 10:44:46,525 INFO L226 Difference]: Without dead ends: 103 [2022-07-22 10:44:46,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-22 10:44:46,527 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 129 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:46,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 115 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:44:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-22 10:44:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-07-22 10:44:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-07-22 10:44:46,547 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 33 [2022-07-22 10:44:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:46,548 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-07-22 10:44:46,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-07-22 10:44:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:44:46,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:46,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:46,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:46,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-22 10:44:46,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:46,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1646708229, now seen corresponding path program 3 times [2022-07-22 10:44:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:46,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102882775] [2022-07-22 10:44:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:46,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:46,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645430776] [2022-07-22 10:44:46,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:44:46,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:46,786 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:46,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 10:44:47,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-22 10:44:47,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:47,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-22 10:44:47,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:47,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:44:47,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:44:47,210 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 57 treesize of output 50 [2022-07-22 10:44:47,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:44:47,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 57 treesize of output 50 [2022-07-22 10:44:47,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:44:47,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,371 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 67 treesize of output 17 [2022-07-22 10:44:47,500 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-22 10:44:47,605 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:44:47,606 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-07-22 10:44:47,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:47,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,623 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 120 treesize of output 194 [2022-07-22 10:44:47,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,673 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 116 treesize of output 57 [2022-07-22 10:44:47,815 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:44:47,815 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 115 [2022-07-22 10:44:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:47,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 173 [2022-07-22 10:44:48,124 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 10:44:48,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 34 [2022-07-22 10:44:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:44:48,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:44:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:50,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102882775] [2022-07-22 10:44:50,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:50,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645430776] [2022-07-22 10:44:50,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645430776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:50,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:50,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-07-22 10:44:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591524004] [2022-07-22 10:44:50,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:50,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-22 10:44:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:50,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-22 10:44:50,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 10:44:50,021 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:51,175 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-22 10:44:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-22 10:44:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 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) Word has length 34 [2022-07-22 10:44:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:51,176 INFO L225 Difference]: With dead ends: 97 [2022-07-22 10:44:51,176 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 10:44:51,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=528, Invalid=2228, Unknown=0, NotChecked=0, Total=2756 [2022-07-22 10:44:51,178 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:51,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 172 Invalid, 0 Unknown, 276 Unchecked, 0.2s Time] [2022-07-22 10:44:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 10:44:51,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-07-22 10:44:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-07-22 10:44:51,188 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 34 [2022-07-22 10:44:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:51,189 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-07-22 10:44:51,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-07-22 10:44:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:44:51,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:51,190 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:51,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:51,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:51,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:51,396 INFO L85 PathProgramCache]: Analyzing trace with hash -653025448, now seen corresponding path program 4 times [2022-07-22 10:44:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:51,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694603180] [2022-07-22 10:44:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:51,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:51,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383169747] [2022-07-22 10:44:51,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:44:51,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:51,424 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:51,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 10:44:51,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:44:51,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:51,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 10:44:51,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:44:51,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:44:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 10:44:51,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:44:51,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694603180] [2022-07-22 10:44:51,605 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:44:51,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383169747] [2022-07-22 10:44:51,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383169747] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:44:51,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:44:51,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-22 10:44:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875007977] [2022-07-22 10:44:51,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:44:51,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 10:44:51,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:44:51,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 10:44:51,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:44:51,607 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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-22 10:44:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:44:51,860 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-07-22 10:44:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 10:44:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-22 10:44:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:44:51,861 INFO L225 Difference]: With dead ends: 120 [2022-07-22 10:44:51,861 INFO L226 Difference]: Without dead ends: 99 [2022-07-22 10:44:51,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-07-22 10:44:51,862 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 156 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:44:51,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 111 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 10:44:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-22 10:44:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2022-07-22 10:44:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:44:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-22 10:44:51,871 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2022-07-22 10:44:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:44:51,872 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-22 10:44:51,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 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-22 10:44:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-22 10:44:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 10:44:51,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:44:51,873 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:44:51,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 10:44:52,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 10:44:52,073 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:44:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:44:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1259217666, now seen corresponding path program 5 times [2022-07-22 10:44:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:44:52,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215899552] [2022-07-22 10:44:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:44:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:44:52,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:44:52,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677789180] [2022-07-22 10:44:52,092 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:44:52,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:44:52,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:44:52,094 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:44:52,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 10:44:53,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-22 10:44:53,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:44:53,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 10:44:53,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:44:53,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:44:53,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:44:53,519 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 110 treesize of output 99 [2022-07-22 10:44:53,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:53,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,528 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-22 10:44:53,641 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 125 treesize of output 110 [2022-07-22 10:44:53,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:53,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 187 [2022-07-22 10:44:53,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-07-22 10:44:53,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,877 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 51 treesize of output 46 [2022-07-22 10:44:53,984 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:44:53,985 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 154 [2022-07-22 10:44:53,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:53,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:53,996 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 123 treesize of output 197 [2022-07-22 10:44:54,184 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:44:54,184 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 156 [2022-07-22 10:44:54,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:54,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 213 [2022-07-22 10:44:54,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 63 [2022-07-22 10:44:54,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:54,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:44:54,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:44:54,373 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 10:44:54,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 90 treesize of output 82 [2022-07-22 10:44:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:44:54,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:45:15,612 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 92 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:45:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 10:45:19,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:45:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215899552] [2022-07-22 10:45:19,242 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:45:19,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677789180] [2022-07-22 10:45:19,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677789180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:45:19,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:45:19,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 27 [2022-07-22 10:45:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143468763] [2022-07-22 10:45:19,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:45:19,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 10:45:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:45:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 10:45:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=560, Unknown=4, NotChecked=0, Total=702 [2022-07-22 10:45:19,243 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:45:31,876 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-07-22 10:45:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-22 10:45:31,876 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-22 10:45:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:45:31,877 INFO L225 Difference]: With dead ends: 97 [2022-07-22 10:45:31,877 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 10:45:31,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=194, Invalid=856, Unknown=6, NotChecked=0, Total=1056 [2022-07-22 10:45:31,877 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:45:31,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 68 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 125 Invalid, 0 Unknown, 176 Unchecked, 0.1s Time] [2022-07-22 10:45:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 10:45:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-07-22 10:45:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2022-07-22 10:45:31,899 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 36 [2022-07-22 10:45:31,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:45:31,900 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2022-07-22 10:45:31,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:45:31,900 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2022-07-22 10:45:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 10:45:31,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:45:31,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:45:31,907 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-22 10:45:32,107 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,SelfDestructingSolverStorable12 [2022-07-22 10:45:32,107 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:45:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:45:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1129715953, now seen corresponding path program 5 times [2022-07-22 10:45:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:45:32,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781513244] [2022-07-22 10:45:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:45:32,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:45:32,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:45:32,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106043865] [2022-07-22 10:45:32,126 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:45:32,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:45:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:45:32,135 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-22 10:45:32,138 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-22 10:45:32,580 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:45:32,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:45:32,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-22 10:45:32,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:45:32,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:45:32,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:45:32,632 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 110 treesize of output 99 [2022-07-22 10:45:32,686 INFO L356 Elim1Store]: treesize reduction 354, result has 8.5 percent of original size [2022-07-22 10:45:32,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 150 [2022-07-22 10:45:32,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 10:45:32,768 INFO L356 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-07-22 10:45:32,768 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 3 case distinctions, treesize of input 36 treesize of output 34 [2022-07-22 10:45:32,800 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 10:45:32,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-22 10:45:32,863 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 151 treesize of output 137 [2022-07-22 10:45:32,910 INFO L356 Elim1Store]: treesize reduction 354, result has 8.5 percent of original size [2022-07-22 10:45:32,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 123 treesize of output 175 [2022-07-22 10:45:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:32,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:32,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:32,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:32,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:32,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:45:32,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 108 [2022-07-22 10:45:33,037 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-22 10:45:33,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 58 [2022-07-22 10:45:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:45:33,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:45:35,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse1 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse1 1))) 31)) is different from false [2022-07-22 10:45:58,965 WARN L233 SmtUtils]: Spent 10.95s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:46:20,077 WARN L233 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 10:46:22,522 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse16 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse1 (not .cse16)) (.cse15 (not .cse6)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse27 1)))))))) (not .cse0))))) is different from false [2022-07-22 10:46:24,536 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse16 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse1 (not .cse16)) (.cse15 (not .cse6)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse27 1)))))))) (not .cse0))))) is different from true [2022-07-22 10:46:26,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse15 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse6 (not .cse15)) (.cse16 (not .cse1)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13 1)))))) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)))) .cse0)))) is different from false [2022-07-22 10:46:28,997 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse15 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse6 (not .cse15)) (.cse16 (not .cse1)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13 1)))))) .cse15)) .cse16))) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)))) .cse0)))) is different from true [2022-07-22 10:46:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 15 refuted. 2 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-22 10:46:29,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781513244] [2022-07-22 10:46:29,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:46:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106043865] [2022-07-22 10:46:29,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106043865] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:46:29,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:46:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-07-22 10:46:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195095732] [2022-07-22 10:46:29,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:46:29,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-22 10:46:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-22 10:46:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=582, Unknown=17, NotChecked=156, Total=870 [2022-07-22 10:46:29,047 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 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-22 10:46:31,138 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse15 (<= (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (let ((.cse6 (not .cse15)) (.cse16 (not .cse1)) (.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (or (not .cse0) (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse4 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse4 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|))))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse13 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse13 1)))))) .cse15)) .cse16))) (= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) 10))) (+ (* 8 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse27 (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse27 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse25 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)))) .cse0)))) is different from true [2022-07-22 10:46:36,090 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (.cse16 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (let ((.cse1 (not .cse16)) (.cse15 (not .cse6)) (.cse0 (<= (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse4 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse2 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse10 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse10 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse9) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse9 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse7 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse14 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) 10))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse11 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) 31)) .cse15)) .cse16))) (= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (or (and (or .cse1 (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse20 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse20 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431)))) (let ((.cse18 (store (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| .cse18) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse18 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse19 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19 1)))))) .cse15) (or .cse6 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse24 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 10 (select .cse24 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ .cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse23 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse21 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) (or .cse16 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_431 Int)) (= 31 (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse28 (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (+ 10 (select .cse28 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))))))) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_431)))) (let ((.cse26 (store (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (let ((.cse27 (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse26 (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ .cse27 1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse27 1)))))))) (not .cse0)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from true [2022-07-22 10:46:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:46:42,043 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-07-22 10:46:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-22 10:46:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 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) Word has length 38 [2022-07-22 10:46:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:46:42,044 INFO L225 Difference]: With dead ends: 89 [2022-07-22 10:46:42,044 INFO L226 Difference]: Without dead ends: 65 [2022-07-22 10:46:42,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 67.0s TimeCoverageRelationStatistics Valid=166, Invalid=827, Unknown=19, NotChecked=320, Total=1332 [2022-07-22 10:46:42,046 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:46:42,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 203 Invalid, 0 Unknown, 173 Unchecked, 0.5s Time] [2022-07-22 10:46:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-22 10:46:42,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-22 10:46:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.109375) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:46:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-07-22 10:46:42,054 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 38 [2022-07-22 10:46:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:46:42,054 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-07-22 10:46:42,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 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-22 10:46:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-07-22 10:46:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-22 10:46:42,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:46:42,055 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:46:42,064 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-22 10:46:42,255 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,SelfDestructingSolverStorable13 [2022-07-22 10:46:42,256 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:46:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:46:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 173090424, now seen corresponding path program 6 times [2022-07-22 10:46:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:46:42,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143352992] [2022-07-22 10:46:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:46:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:46:42,289 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:46:42,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039345617] [2022-07-22 10:46:42,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:46:42,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:46:42,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:46:42,294 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-22 10:46:42,299 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-22 10:46:42,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-22 10:46:42,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:46:42,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-22 10:46:42,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:46:42,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:46:42,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:46:43,022 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 57 treesize of output 50 [2022-07-22 10:46:43,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:46:43,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,043 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 73 treesize of output 24 [2022-07-22 10:46:43,088 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 57 treesize of output 50 [2022-07-22 10:46:43,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:46:43,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 10:46:43,192 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-22 10:46:43,261 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:46:43,262 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-07-22 10:46:43,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:46:43,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,273 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 120 treesize of output 194 [2022-07-22 10:46:43,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 98 [2022-07-22 10:46:43,422 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:46:43,422 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 91 [2022-07-22 10:46:43,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 157 [2022-07-22 10:46:43,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 41 [2022-07-22 10:46:43,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:46:43,536 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:46:43,536 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 3 case distinctions, treesize of input 43 treesize of output 44 [2022-07-22 10:46:43,684 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 10:46:43,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 32 [2022-07-22 10:46:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:43,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:46:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:46:58,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:46:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143352992] [2022-07-22 10:46:58,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:46:58,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039345617] [2022-07-22 10:46:58,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039345617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:46:58,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:46:58,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2022-07-22 10:46:58,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327675791] [2022-07-22 10:46:58,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:46:58,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-22 10:46:58,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:46:58,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 10:46:58,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 10:46:58,388 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:47:00,718 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-07-22 10:47:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-22 10:47:00,719 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 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 40 [2022-07-22 10:47:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:47:00,719 INFO L225 Difference]: With dead ends: 104 [2022-07-22 10:47:00,719 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 10:47:00,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=257, Invalid=1383, Unknown=0, NotChecked=0, Total=1640 [2022-07-22 10:47:00,721 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 10:47:00,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 98 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 187 Invalid, 0 Unknown, 224 Unchecked, 0.2s Time] [2022-07-22 10:47:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 10:47:00,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2022-07-22 10:47:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 92 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-07-22 10:47:00,734 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 40 [2022-07-22 10:47:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:47:00,734 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-07-22 10:47:00,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-07-22 10:47:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-22 10:47:00,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:47:00,735 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:47:00,742 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-22 10:47:00,942 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,SelfDestructingSolverStorable14 [2022-07-22 10:47:00,943 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:47:00,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:47:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash -734671131, now seen corresponding path program 6 times [2022-07-22 10:47:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:47:00,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587048776] [2022-07-22 10:47:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:47:00,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:47:00,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:47:00,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [892118443] [2022-07-22 10:47:00,963 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 10:47:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:47:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:47:00,964 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-22 10:47:00,988 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-22 10:47:05,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-22 10:47:05,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:47:05,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-22 10:47:05,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:47:05,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:47:05,938 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-22 10:47:05,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:05,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:05,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:05,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:47:06,014 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-22 10:47:06,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:47:06,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,038 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 73 treesize of output 24 [2022-07-22 10:47:06,086 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-22 10:47:06,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:47:06,189 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-22 10:47:06,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:06,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-07-22 10:47:06,199 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 10:47:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:47:06,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:47:07,429 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 54 treesize of output 52 [2022-07-22 10:47:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 10:47:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:47:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587048776] [2022-07-22 10:47:07,687 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:47:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892118443] [2022-07-22 10:47:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892118443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:47:07,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:47:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 38 [2022-07-22 10:47:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574054437] [2022-07-22 10:47:07,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:47:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-22 10:47:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:47:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-22 10:47:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 10:47:07,690 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:47:12,110 INFO L93 Difference]: Finished difference Result 213 states and 231 transitions. [2022-07-22 10:47:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-22 10:47:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 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 42 [2022-07-22 10:47:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:47:12,111 INFO L225 Difference]: With dead ends: 213 [2022-07-22 10:47:12,111 INFO L226 Difference]: Without dead ends: 211 [2022-07-22 10:47:12,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 44 SyntacticMatches, 15 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1264, Invalid=6218, Unknown=0, NotChecked=0, Total=7482 [2022-07-22 10:47:12,113 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 390 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 10:47:12,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 426 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 531 Invalid, 0 Unknown, 492 Unchecked, 0.6s Time] [2022-07-22 10:47:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-22 10:47:12,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2022-07-22 10:47:12,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.140495867768595) internal successors, (138), 121 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2022-07-22 10:47:12,129 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 42 [2022-07-22 10:47:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:47:12,130 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2022-07-22 10:47:12,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:47:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2022-07-22 10:47:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 10:47:12,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:47:12,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:47:12,139 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-22 10:47:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:47:12,332 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:47:12,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:47:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1596358930, now seen corresponding path program 7 times [2022-07-22 10:47:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:47:12,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610987536] [2022-07-22 10:47:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:47:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:47:12,353 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:47:12,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655559166] [2022-07-22 10:47:12,353 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-22 10:47:12,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:47:12,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:47:12,355 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-22 10:47:12,380 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-22 10:47:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:47:12,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-22 10:47:12,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:47:12,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-22 10:47:12,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-22 10:47:12,877 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 110 treesize of output 99 [2022-07-22 10:47:12,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:47:12,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,887 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-22 10:47:12,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,922 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 105 treesize of output 37 [2022-07-22 10:47:12,993 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 94 treesize of output 83 [2022-07-22 10:47:12,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:12,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 147 [2022-07-22 10:47:13,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 54 [2022-07-22 10:47:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-22 10:47:13,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-22 10:47:13,320 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:47:13,321 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 137 [2022-07-22 10:47:13,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:47:13,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,332 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 123 treesize of output 197 [2022-07-22 10:47:13,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,374 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 118 treesize of output 59 [2022-07-22 10:47:13,481 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-22 10:47:13,481 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 150 [2022-07-22 10:47:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:47:13,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 216 [2022-07-22 10:47:13,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 85 [2022-07-22 10:47:13,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:47:13,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:47:13,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:47:13,649 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-22 10:47:13,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 78 [2022-07-22 10:47:14,108 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-22 10:47:14,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 134 treesize of output 66 [2022-07-22 10:47:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:47:14,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:47:57,242 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 88241170 treesize of output 87340050