./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s52if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/s52if.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 adec1fb94d6967416fde705f346e339b2564f221f40b7d50198f8ed5e502aa54 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:13:06,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:13:06,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:13:06,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:13:06,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:13:06,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:13:06,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:13:06,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:13:06,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:13:06,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:13:06,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:13:06,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:13:06,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:13:06,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:13:06,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:13:06,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:13:06,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:13:06,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:13:06,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:13:06,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:13:06,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:13:06,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:13:06,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:13:06,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:13:06,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:13:06,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:13:06,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:13:06,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:13:06,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:13:06,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:13:06,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:13:06,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:13:06,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:13:06,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:13:06,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:13:06,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:13:06,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:13:06,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:13:06,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:13:06,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:13:06,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:13:06,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:13:06,582 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:13:06,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:13:06,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:13:06,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:13:06,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:13:06,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:13:06,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:13:06,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:13:06,584 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:13:06,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:13:06,585 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:13:06,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:13:06,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:13:06,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:13:06,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:13:06,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:13:06,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:13:06,587 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:13:06,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:13:06,587 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:13:06,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:13:06,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:13:06,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:13:06,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:13:06,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:13:06,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:13:06,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:13:06,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:13:06,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:13:06,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:13:06,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:13:06,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:13:06,589 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:13:06,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:13:06,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:13:06,590 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> adec1fb94d6967416fde705f346e339b2564f221f40b7d50198f8ed5e502aa54 [2023-02-15 10:13:06,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:13:06,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:13:06,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:13:06,848 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:13:06,848 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:13:06,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s52if.c [2023-02-15 10:13:08,027 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:13:08,200 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:13:08,201 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s52if.c [2023-02-15 10:13:08,206 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69e48700/2dea5a69830540848d99f60324531a3f/FLAG834d3ad43 [2023-02-15 10:13:08,220 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d69e48700/2dea5a69830540848d99f60324531a3f [2023-02-15 10:13:08,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:13:08,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:13:08,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:13:08,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:13:08,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:13:08,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9ddf67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08, skipping insertion in model container [2023-02-15 10:13:08,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:13:08,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:13:08,361 WARN L237 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/s52if.c[588,601] [2023-02-15 10:13:08,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:13:08,383 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:13:08,394 WARN L237 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/s52if.c[588,601] [2023-02-15 10:13:08,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:13:08,427 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:13:08,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08 WrapperNode [2023-02-15 10:13:08,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:13:08,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:13:08,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:13:08,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:13:08,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,465 INFO L138 Inliner]: procedures = 17, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-15 10:13:08,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:13:08,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:13:08,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:13:08,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:13:08,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:13:08,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:13:08,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:13:08,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:13:08,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (1/1) ... [2023-02-15 10:13:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:13:08,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:08,522 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) [2023-02-15 10:13:08,528 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 [2023-02-15 10:13:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:13:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:13:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:13:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:13:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:13:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:13:08,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:13:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:13:08,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:13:08,616 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:13:08,618 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:13:08,755 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:13:08,783 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:13:08,783 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 10:13:08,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:13:08 BoogieIcfgContainer [2023-02-15 10:13:08,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:13:08,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:13:08,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:13:08,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:13:08,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:13:08" (1/3) ... [2023-02-15 10:13:08,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3852980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:13:08, skipping insertion in model container [2023-02-15 10:13:08,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:13:08" (2/3) ... [2023-02-15 10:13:08,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3852980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:13:08, skipping insertion in model container [2023-02-15 10:13:08,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:13:08" (3/3) ... [2023-02-15 10:13:08,792 INFO L112 eAbstractionObserver]: Analyzing ICFG s52if.c [2023-02-15 10:13:08,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:13:08,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:13:08,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:13:08,851 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1488feca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:13:08,851 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:13:08,853 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) [2023-02-15 10:13:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:13:08,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:08,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:08,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:08,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2023-02-15 10:13:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:08,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828855002] [2023-02-15 10:13:08,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:08,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:09,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:09,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828855002] [2023-02-15 10:13:09,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828855002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:13:09,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:13:09,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:13:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313733727] [2023-02-15 10:13:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:13:09,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:13:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:09,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:13:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:13:09,082 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.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:09,099 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2023-02-15 10:13:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:13:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 10:13:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:09,107 INFO L225 Difference]: With dead ends: 42 [2023-02-15 10:13:09,107 INFO L226 Difference]: Without dead ends: 19 [2023-02-15 10:13:09,110 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 [2023-02-15 10:13:09,114 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 [2023-02-15 10:13:09,115 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] [2023-02-15 10:13:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-15 10:13:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-15 10:13:09,141 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) [2023-02-15 10:13:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-02-15 10:13:09,143 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2023-02-15 10:13:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:09,144 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-02-15 10:13:09,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:09,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-02-15 10:13:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:13:09,145 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:09,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:09,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:13:09,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2023-02-15 10:13:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:09,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587316892] [2023-02-15 10:13:09,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:09,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:09,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587316892] [2023-02-15 10:13:09,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587316892] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:13:09,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:13:09,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:13:09,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341582085] [2023-02-15 10:13:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:13:09,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:13:09,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:13:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:13:09,365 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:09,440 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2023-02-15 10:13:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:13:09,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 10:13:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:09,441 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:13:09,442 INFO L226 Difference]: Without dead ends: 27 [2023-02-15 10:13:09,443 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 [2023-02-15 10:13:09,444 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:09,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-15 10:13:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-02-15 10:13:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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) [2023-02-15 10:13:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-02-15 10:13:09,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2023-02-15 10:13:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:09,456 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-02-15 10:13:09,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-02-15 10:13:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:13:09,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:09,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:09,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:13:09,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2023-02-15 10:13:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:09,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025218074] [2023-02-15 10:13:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:10,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025218074] [2023-02-15 10:13:10,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025218074] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303195448] [2023-02-15 10:13:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:10,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:10,064 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) [2023-02-15 10:13:10,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:13:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:10,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 10:13:10,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:10,261 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:10,268 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:10,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:10,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:10,456 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 27 [2023-02-15 10:13:10,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-02-15 10:13:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:10,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:10,712 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~N~0 6))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_45 (Array Int Int))) (let ((.cse0 (select v_ArrVal_45 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 6 .cse0)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0) .cse1)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_45 (Array Int Int))) (let ((.cse2 (select v_ArrVal_45 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 6 .cse2)) (<= .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse2))))))) is different from false [2023-02-15 10:13:10,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:13:10,949 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 72 [2023-02-15 10:13:10,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:13:10,955 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 54 [2023-02-15 10:13:10,959 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2023-02-15 10:13:10,962 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 10 [2023-02-15 10:13:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 10:13:10,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303195448] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:10,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:10,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2023-02-15 10:13:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580136250] [2023-02-15 10:13:10,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:10,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 10:13:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 10:13:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=372, Unknown=1, NotChecked=40, Total=506 [2023-02-15 10:13:11,003 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 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) [2023-02-15 10:13:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:18,105 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-02-15 10:13:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 10:13:18,109 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 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 [2023-02-15 10:13:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:18,111 INFO L225 Difference]: With dead ends: 51 [2023-02-15 10:13:18,111 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 10:13:18,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=307, Invalid=956, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 10:13:18,113 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 133 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 59 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:18,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 43 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 264 Invalid, 3 Unknown, 50 Unchecked, 0.3s Time] [2023-02-15 10:13:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 10:13:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2023-02-15 10:13:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 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) [2023-02-15 10:13:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2023-02-15 10:13:18,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 21 [2023-02-15 10:13:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:18,121 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2023-02-15 10:13:18,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 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) [2023-02-15 10:13:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2023-02-15 10:13:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:13:18,122 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:18,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:18,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 10:13:18,329 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 [2023-02-15 10:13:18,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:18,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2023-02-15 10:13:18,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:18,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483372758] [2023-02-15 10:13:18,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:18,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:18,344 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:13:18,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777067767] [2023-02-15 10:13:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:18,347 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) [2023-02-15 10:13:18,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:13:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:18,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 10:13:18,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:18,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 10:13:18,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:13:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:18,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:18,530 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 31 [2023-02-15 10:13:18,536 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:13:18,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2023-02-15 10:13:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483372758] [2023-02-15 10:13:18,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:13:18,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777067767] [2023-02-15 10:13:18,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777067767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:18,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:13:18,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2023-02-15 10:13:18,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472263469] [2023-02-15 10:13:18,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:18,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 10:13:18,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 10:13:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:13:18,553 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:18,697 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2023-02-15 10:13:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 10:13:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 10:13:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:18,698 INFO L225 Difference]: With dead ends: 75 [2023-02-15 10:13:18,699 INFO L226 Difference]: Without dead ends: 63 [2023-02-15 10:13:18,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:13:18,700 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:18,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 58 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-02-15 10:13:18,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2023-02-15 10:13:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 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) [2023-02-15 10:13:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-02-15 10:13:18,710 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 21 [2023-02-15 10:13:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:18,710 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-02-15 10:13:18,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-02-15 10:13:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 10:13:18,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:18,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:18,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:18,917 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 [2023-02-15 10:13:18,917 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1592625659, now seen corresponding path program 1 times [2023-02-15 10:13:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:18,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186642786] [2023-02-15 10:13:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:18,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:13:18,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456968835] [2023-02-15 10:13:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:18,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:18,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:18,930 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) [2023-02-15 10:13:18,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:13:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:18,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 10:13:18,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:19,003 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:19,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:13:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:19,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:19,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 10:13:19,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-15 10:13:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:19,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186642786] [2023-02-15 10:13:19,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:13:19,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456968835] [2023-02-15 10:13:19,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456968835] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:19,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:13:19,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-15 10:13:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901419482] [2023-02-15 10:13:19,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:19,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 10:13:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 10:13:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:13:19,072 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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) [2023-02-15 10:13:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:19,148 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2023-02-15 10:13:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:13:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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 21 [2023-02-15 10:13:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:19,149 INFO L225 Difference]: With dead ends: 78 [2023-02-15 10:13:19,149 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 10:13:19,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:13:19,150 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:19,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 51 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 10:13:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2023-02-15 10:13:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 48 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) [2023-02-15 10:13:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2023-02-15 10:13:19,160 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2023-02-15 10:13:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:19,160 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2023-02-15 10:13:19,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 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) [2023-02-15 10:13:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2023-02-15 10:13:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:13:19,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:19,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:19,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:19,367 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 [2023-02-15 10:13:19,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2023-02-15 10:13:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:19,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265407540] [2023-02-15 10:13:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:19,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:19,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265407540] [2023-02-15 10:13:19,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265407540] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896150320] [2023-02-15 10:13:19,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:13:19,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:19,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:19,444 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) [2023-02-15 10:13:19,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:13:19,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:13:19,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:19,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:13:19,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:19,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:19,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:19,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896150320] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:19,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:19,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:13:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955114069] [2023-02-15 10:13:19,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:19,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:13:19,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:19,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:13:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:13:19,627 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:19,797 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2023-02-15 10:13:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:13:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:13:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:19,799 INFO L225 Difference]: With dead ends: 85 [2023-02-15 10:13:19,799 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 10:13:19,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:13:19,800 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:19,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 10:13:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2023-02-15 10:13:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 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) [2023-02-15 10:13:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-02-15 10:13:19,810 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 23 [2023-02-15 10:13:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:19,811 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-02-15 10:13:19,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-02-15 10:13:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:13:19,812 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:19,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:19,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:20,018 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 [2023-02-15 10:13:20,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2023-02-15 10:13:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980530812] [2023-02-15 10:13:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980530812] [2023-02-15 10:13:20,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980530812] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851683627] [2023-02-15 10:13:20,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:13:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:20,090 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) [2023-02-15 10:13:20,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:13:20,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:13:20,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:20,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:13:20,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:20,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:13:20,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851683627] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:20,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:20,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:13:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43823390] [2023-02-15 10:13:20,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:20,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:13:20,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:13:20,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:13:20,253 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) [2023-02-15 10:13:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:20,367 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2023-02-15 10:13:20,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:13:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 [2023-02-15 10:13:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:20,369 INFO L225 Difference]: With dead ends: 78 [2023-02-15 10:13:20,369 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 10:13:20,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:13:20,370 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:20,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 25 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 10:13:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-02-15 10:13:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-02-15 10:13:20,376 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2023-02-15 10:13:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:20,376 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-02-15 10:13:20,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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) [2023-02-15 10:13:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-02-15 10:13:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:13:20,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:20,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:20,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:20,589 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 [2023-02-15 10:13:20,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2023-02-15 10:13:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785453886] [2023-02-15 10:13:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:13:21,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:21,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785453886] [2023-02-15 10:13:21,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785453886] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:21,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619891092] [2023-02-15 10:13:21,156 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:13:21,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:21,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:21,161 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) [2023-02-15 10:13:21,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:13:21,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:13:21,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:21,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 10:13:21,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:21,251 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:21,257 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:21,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:21,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:21,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:21,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:21,533 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 27 [2023-02-15 10:13:21,640 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:13:21,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 10:13:21,737 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:13:21,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2023-02-15 10:13:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:21,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:22,147 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~N~0 6))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 6 .cse0)) (forall ((v_subst_1 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse1 6)) (<= .cse2 (+ .cse1 .cse3 .cse0))))))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int))) (let ((.cse6 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 6 .cse6)) (forall ((v_subst_2 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (<= (+ .cse7 .cse6 .cse8) .cse2) (not (= 6 .cse8))))))))))))) is different from false [2023-02-15 10:13:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 10:13:25,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619891092] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:25,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:25,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 36 [2023-02-15 10:13:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734663227] [2023-02-15 10:13:25,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:25,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-15 10:13:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-15 10:13:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1050, Unknown=5, NotChecked=66, Total=1260 [2023-02-15 10:13:25,209 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 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) [2023-02-15 10:13:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:31,887 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2023-02-15 10:13:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 10:13:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:13:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:31,889 INFO L225 Difference]: With dead ends: 82 [2023-02-15 10:13:31,889 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 10:13:31,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=393, Invalid=2358, Unknown=9, NotChecked=102, Total=2862 [2023-02-15 10:13:31,891 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 99 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 112 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:31,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 143 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 644 Invalid, 15 Unknown, 50 Unchecked, 1.1s Time] [2023-02-15 10:13:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 10:13:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2023-02-15 10:13:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 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) [2023-02-15 10:13:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2023-02-15 10:13:31,909 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2023-02-15 10:13:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:31,912 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2023-02-15 10:13:31,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 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) [2023-02-15 10:13:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2023-02-15 10:13:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:13:31,916 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:31,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:31,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:32,122 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 [2023-02-15 10:13:32,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2023-02-15 10:13:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966361749] [2023-02-15 10:13:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:32,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:13:32,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570882603] [2023-02-15 10:13:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:32,137 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) [2023-02-15 10:13:32,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:13:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:32,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 10:13:32,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:32,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-15 10:13:32,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:32,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:13:32,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:13:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:13:32,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:32,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2023-02-15 10:13:32,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:13:32,449 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2023-02-15 10:13:32,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:13:32,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2023-02-15 10:13:32,458 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 10:13:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2023-02-15 10:13:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:32,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966361749] [2023-02-15 10:13:32,516 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:13:32,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570882603] [2023-02-15 10:13:32,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570882603] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:32,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:13:32,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-02-15 10:13:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717284134] [2023-02-15 10:13:32,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:32,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 10:13:32,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 10:13:32,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=4, NotChecked=32, Total=342 [2023-02-15 10:13:32,521 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) [2023-02-15 10:13:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:32,853 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2023-02-15 10:13:32,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:13:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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 29 [2023-02-15 10:13:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:32,855 INFO L225 Difference]: With dead ends: 114 [2023-02-15 10:13:32,855 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 10:13:32,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=4, NotChecked=40, Total=506 [2023-02-15 10:13:32,856 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:32,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 94 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 367 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2023-02-15 10:13:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 10:13:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 71. [2023-02-15 10:13:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-02-15 10:13:32,870 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 29 [2023-02-15 10:13:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:32,870 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-02-15 10:13:32,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) [2023-02-15 10:13:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-02-15 10:13:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:13:32,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:32,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:32,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 10:13:33,077 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 [2023-02-15 10:13:33,077 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:33,078 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2023-02-15 10:13:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:33,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009219709] [2023-02-15 10:13:33,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:33,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:33,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:13:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177694118] [2023-02-15 10:13:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:33,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:33,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:33,101 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) [2023-02-15 10:13:33,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:13:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:33,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 10:13:33,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:33,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:13:33,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:13:33,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 10:13:33,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:13:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:33,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:33,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 10:13:33,293 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 16 [2023-02-15 10:13:33,312 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:33,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009219709] [2023-02-15 10:13:33,312 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:13:33,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177694118] [2023-02-15 10:13:33,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177694118] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:33,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:13:33,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-15 10:13:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092535073] [2023-02-15 10:13:33,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:33,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:13:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:13:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:13:33,314 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:33,458 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2023-02-15 10:13:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:13:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:13:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:33,459 INFO L225 Difference]: With dead ends: 115 [2023-02-15 10:13:33,459 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 10:13:33,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-02-15 10:13:33,460 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:33,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 66 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 10:13:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2023-02-15 10:13:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 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) [2023-02-15 10:13:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2023-02-15 10:13:33,473 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 29 [2023-02-15 10:13:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:33,474 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2023-02-15 10:13:33,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2023-02-15 10:13:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 10:13:33,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:33,475 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:33,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:33,680 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 [2023-02-15 10:13:33,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2023-02-15 10:13:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970712229] [2023-02-15 10:13:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:33,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:33,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970712229] [2023-02-15 10:13:33,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970712229] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:33,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445304156] [2023-02-15 10:13:33,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:13:33,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:33,785 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) [2023-02-15 10:13:33,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:13:33,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 10:13:33,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:33,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:13:33,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:33,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445304156] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:34,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:13:34,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658764727] [2023-02-15 10:13:34,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:34,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:13:34,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:13:34,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:13:34,021 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:34,215 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2023-02-15 10:13:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:13:34,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 10:13:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:34,216 INFO L225 Difference]: With dead ends: 121 [2023-02-15 10:13:34,216 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 10:13:34,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:13:34,217 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:34,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 25 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 10:13:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 75. [2023-02-15 10:13:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 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) [2023-02-15 10:13:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-02-15 10:13:34,230 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 31 [2023-02-15 10:13:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:34,230 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-02-15 10:13:34,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-02-15 10:13:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:13:34,231 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:34,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:34,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 10:13:34,439 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 [2023-02-15 10:13:34,439 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2023-02-15 10:13:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:34,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831446041] [2023-02-15 10:13:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:34,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:34,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831446041] [2023-02-15 10:13:34,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831446041] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:34,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232163381] [2023-02-15 10:13:34,560 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 10:13:34,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:34,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:34,561 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) [2023-02-15 10:13:34,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:13:34,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-15 10:13:34,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:13:34,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:13:34,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:34,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:13:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232163381] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:34,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:34,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:13:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942160809] [2023-02-15 10:13:34,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:13:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:13:34,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:13:34,761 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:13:34,905 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2023-02-15 10:13:34,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:13:34,906 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 10:13:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:13:34,906 INFO L225 Difference]: With dead ends: 109 [2023-02-15 10:13:34,906 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 10:13:34,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:13:34,907 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:13:34,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 23 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:13:34,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 10:13:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2023-02-15 10:13:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-02-15 10:13:34,916 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 32 [2023-02-15 10:13:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:13:34,916 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-02-15 10:13:34,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:13:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-02-15 10:13:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:13:34,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:13:34,917 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:13:34,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 10:13:35,123 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 [2023-02-15 10:13:35,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:13:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:13:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2023-02-15 10:13:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:13:35,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65493089] [2023-02-15 10:13:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:13:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:13:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 10:13:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:13:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65493089] [2023-02-15 10:13:35,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65493089] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:13:35,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037527931] [2023-02-15 10:13:35,899 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 10:13:35,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:13:35,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:13:35,901 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) [2023-02-15 10:13:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 10:13:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:13:35,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 10:13:35,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:13:36,045 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:36,051 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:13:36,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:36,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:36,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:36,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:36,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:36,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:13:36,417 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 27 [2023-02-15 10:13:36,529 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:13:36,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2023-02-15 10:13:36,654 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:13:36,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-15 10:13:36,748 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:13:36,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2023-02-15 10:13:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:13:36,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:13:37,751 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~N~0 6))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse3 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (forall ((v_subst_6 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (or (forall ((v_subst_3 Int)) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (or (not (= .cse0 6)) (<= .cse1 (+ .cse2 .cse3 .cse0 .cse4))))) (not (= .cse2 6)))))))) (not (= .cse3 6))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int)) (let ((.cse7 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (forall ((v_subst_5 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (or (forall ((v_subst_4 Int)) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (or (<= (+ .cse7 .cse8 .cse9 .cse10) .cse1) (not (= 6 .cse9))))) (not (= .cse8 6)))))))) (not (= .cse7 6))))))) is different from false [2023-02-15 10:13:42,906 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:13:42,907 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 835 treesize of output 1 [2023-02-15 10:13:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2023-02-15 10:13:42,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037527931] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:42,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:42,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 44 [2023-02-15 10:13:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925215369] [2023-02-15 10:13:42,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:42,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 10:13:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 10:13:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1637, Unknown=1, NotChecked=82, Total=1892 [2023-02-15 10:13:42,911 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 44 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 44 states have internal predecessors, (80), 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) [2023-02-15 10:14:10,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:14:26,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:14:42,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-15 10:14:57,648 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 110 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:15:00,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:15:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:01,742 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2023-02-15 10:15:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-02-15 10:15:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 44 states have internal predecessors, (80), 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 37 [2023-02-15 10:15:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:01,743 INFO L225 Difference]: With dead ends: 138 [2023-02-15 10:15:01,743 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 10:15:01,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2826 ImplicationChecksByTransitivity, 71.7s TimeCoverageRelationStatistics Valid=1152, Invalid=8922, Unknown=30, NotChecked=198, Total=10302 [2023-02-15 10:15:01,745 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 154 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 211 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:01,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 160 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1346 Invalid, 11 Unknown, 97 Unchecked, 13.0s Time] [2023-02-15 10:15:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 10:15:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 97. [2023-02-15 10:15:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 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) [2023-02-15 10:15:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2023-02-15 10:15:01,772 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 37 [2023-02-15 10:15:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:01,772 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2023-02-15 10:15:01,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 44 states have internal predecessors, (80), 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) [2023-02-15 10:15:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2023-02-15 10:15:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:15:01,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:01,773 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:01,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:01,974 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 [2023-02-15 10:15:01,974 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:01,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2023-02-15 10:15:01,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:01,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040528999] [2023-02-15 10:15:01,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:01,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:01,985 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:15:01,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933068969] [2023-02-15 10:15:01,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:15:01,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:01,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:01,988 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) [2023-02-15 10:15:02,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 10:15:02,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:15:02,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:02,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 10:15:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:02,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-02-15 10:15:02,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:15:02,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:15:02,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:15:02,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:15:02,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:15:02,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2023-02-15 10:15:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:02,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:10,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:15:10,060 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2023-02-15 10:15:10,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:15:10,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2023-02-15 10:15:10,078 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 7 [2023-02-15 10:15:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:10,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:10,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040528999] [2023-02-15 10:15:10,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:15:10,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933068969] [2023-02-15 10:15:10,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933068969] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:10,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:15:10,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-15 10:15:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668332506] [2023-02-15 10:15:10,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:10,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 10:15:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 10:15:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=907, Unknown=14, NotChecked=0, Total=1122 [2023-02-15 10:15:10,655 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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) [2023-02-15 10:15:38,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:15:40,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-15 10:15:41,159 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_498 (Array Int Int))) (or (< 2 |v_ULTIMATE.start_main_~i~0#1_146|) (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_146| 1) c_~N~0))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 3 c_~N~0) (or (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_498 (Array Int Int))) (or (= 6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ 5 (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)))) (< 2 |v_ULTIMATE.start_main_~i~0#1_146|) (< (+ |v_ULTIMATE.start_main_~i~0#1_146| 1) c_~N~0)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_498 (Array Int Int))) (or (= 6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_146| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2023-02-15 10:15:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:52,393 INFO L93 Difference]: Finished difference Result 279 states and 366 transitions. [2023-02-15 10:15:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 10:15:52,393 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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 37 [2023-02-15 10:15:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:52,394 INFO L225 Difference]: With dead ends: 279 [2023-02-15 10:15:52,395 INFO L226 Difference]: Without dead ends: 272 [2023-02-15 10:15:52,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=678, Invalid=2589, Unknown=43, NotChecked=112, Total=3422 [2023-02-15 10:15:52,396 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 122 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:52,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 94 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 756 Invalid, 6 Unknown, 1 Unchecked, 3.8s Time] [2023-02-15 10:15:52,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-15 10:15:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 170. [2023-02-15 10:15:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 169 states have internal predecessors, (221), 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) [2023-02-15 10:15:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2023-02-15 10:15:52,431 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 37 [2023-02-15 10:15:52,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:52,431 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2023-02-15 10:15:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 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) [2023-02-15 10:15:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2023-02-15 10:15:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 10:15:52,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:52,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:52,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:52,638 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 [2023-02-15 10:15:52,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2023-02-15 10:15:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:52,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055667312] [2023-02-15 10:15:52,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:52,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:15:52,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893073769] [2023-02-15 10:15:52,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:15:52,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:52,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:52,657 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) [2023-02-15 10:15:52,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 10:15:52,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:15:52,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:52,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 10:15:52,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:52,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:15:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:15:52,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 10:15:52,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:15:52,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 10:15:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:15:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:52,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:53,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 10:15:53,052 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 16 [2023-02-15 10:15:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:53,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055667312] [2023-02-15 10:15:53,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:15:53,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893073769] [2023-02-15 10:15:53,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893073769] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:53,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:15:53,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-02-15 10:15:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026130651] [2023-02-15 10:15:53,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:53,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:15:53,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:15:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:15:53,114 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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) [2023-02-15 10:15:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:53,481 INFO L93 Difference]: Finished difference Result 292 states and 388 transitions. [2023-02-15 10:15:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 10:15:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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 37 [2023-02-15 10:15:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:53,482 INFO L225 Difference]: With dead ends: 292 [2023-02-15 10:15:53,482 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 10:15:53,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-02-15 10:15:53,483 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:53,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:15:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 10:15:53,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2023-02-15 10:15:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 169 states have internal predecessors, (219), 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) [2023-02-15 10:15:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2023-02-15 10:15:53,512 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 37 [2023-02-15 10:15:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:53,512 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2023-02-15 10:15:53,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 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) [2023-02-15 10:15:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2023-02-15 10:15:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 10:15:53,513 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:53,513 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:53,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:53,719 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 [2023-02-15 10:15:53,719 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:53,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2023-02-15 10:15:53,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:53,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626926547] [2023-02-15 10:15:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:15:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626926547] [2023-02-15 10:15:53,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626926547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:15:53,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10610022] [2023-02-15 10:15:53,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:15:53,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:53,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:53,901 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) [2023-02-15 10:15:53,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 10:15:53,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:15:53,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:53,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:15:53,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:54,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:54,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10610022] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:54,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:15:54,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 10:15:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105822741] [2023-02-15 10:15:54,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:15:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:15:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:15:54,245 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:54,783 INFO L93 Difference]: Finished difference Result 213 states and 275 transitions. [2023-02-15 10:15:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:15:54,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-15 10:15:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:54,785 INFO L225 Difference]: With dead ends: 213 [2023-02-15 10:15:54,786 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 10:15:54,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:15:54,787 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 94 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:54,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 28 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:15:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 10:15:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 109. [2023-02-15 10:15:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.25) internal successors, (135), 108 states have internal predecessors, (135), 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) [2023-02-15 10:15:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2023-02-15 10:15:54,809 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 39 [2023-02-15 10:15:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:54,810 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2023-02-15 10:15:54,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2023-02-15 10:15:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 10:15:54,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:54,811 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:54,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:55,016 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 [2023-02-15 10:15:55,016 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2023-02-15 10:15:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:55,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920503813] [2023-02-15 10:15:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:55,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:15:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:55,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920503813] [2023-02-15 10:15:55,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920503813] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:15:55,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864719183] [2023-02-15 10:15:55,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:15:55,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:55,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:55,181 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) [2023-02-15 10:15:55,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 10:15:55,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 10:15:55,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:55,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:15:55,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:55,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:15:55,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864719183] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:55,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:15:55,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 10:15:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790679722] [2023-02-15 10:15:55,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:55,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:15:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:15:55,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:15:55,493 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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) [2023-02-15 10:15:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:15:55,735 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2023-02-15 10:15:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:15:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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 [2023-02-15 10:15:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:15:55,736 INFO L225 Difference]: With dead ends: 138 [2023-02-15 10:15:55,736 INFO L226 Difference]: Without dead ends: 61 [2023-02-15 10:15:55,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-02-15 10:15:55,737 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 86 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:15:55,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 34 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:15:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-15 10:15:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-02-15 10:15:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 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) [2023-02-15 10:15:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2023-02-15 10:15:55,748 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 40 [2023-02-15 10:15:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:15:55,748 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2023-02-15 10:15:55,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 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) [2023-02-15 10:15:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2023-02-15 10:15:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:15:55,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:15:55,749 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:15:55,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 10:15:55,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 10:15:55,949 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:15:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:15:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2023-02-15 10:15:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:15:55,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417611771] [2023-02-15 10:15:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:15:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:15:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:15:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 10:15:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:15:57,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417611771] [2023-02-15 10:15:57,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417611771] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:15:57,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212997760] [2023-02-15 10:15:57,086 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:15:57,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:15:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:15:57,087 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:15:57,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 10:15:57,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:15:57,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:15:57,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 69 conjunts are in the unsatisfiable core [2023-02-15 10:15:57,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:15:57,185 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:15:57,190 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:15:57,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:15:57,536 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 27 [2023-02-15 10:15:57,688 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:15:57,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-15 10:15:57,908 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-15 10:15:57,908 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 90 treesize of output 59 [2023-02-15 10:15:58,123 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:15:58,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2023-02-15 10:15:58,238 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:15:58,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 35 [2023-02-15 10:15:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 10:15:58,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:16:03,913 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~N~0 6))) (and (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= 6 .cse0)) (forall ((v_subst_11 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (or (forall ((v_subst_9 Int)) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (or (forall ((v_subst_7 Int)) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (<= .cse1 (+ .cse2 .cse3 .cse4 .cse5 .cse0)) (not (= 6 .cse5))))) (not (= 6 .cse4))))) (not (= .cse3 6))))))))))) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse12 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (forall ((v_subst_12 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (or (not (= .cse8 6)) (forall ((v_subst_10 Int)) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (or (not (= .cse9 6)) (forall ((v_subst_8 Int)) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8 .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (<= (+ .cse10 .cse11 .cse8 .cse9 .cse12) .cse1) (not (= .cse10 6)))))))))))))) (not (= 6 .cse12))))))) is different from false [2023-02-15 10:16:07,735 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_230| Int) (v_subst_9 Int) (v_subst_7 Int) (v_subst_11 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_230| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 6 .cse0)) (< (+ .cse1 5) (+ .cse2 .cse3 .cse4 .cse5 .cse0)) (not (= .cse3 6)) (not (= 6 .cse5)) (not (= .cse4 6)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_736 (Array Int Int)) (v_subst_8 Int) (v_subst_10 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse8 6)) (not (= .cse9 6)) (< (+ .cse10 .cse11 .cse8 .cse9 .cse12) (+ 7 .cse1)) (not (= 6 .cse12)) (not (= .cse10 6)))))))))))) is different from false [2023-02-15 10:16:07,869 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_736 (Array Int Int)) (v_subst_8 Int) (v_subst_10 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse0 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse0 6)) (not (= .cse1 6)) (not (= 6 .cse2)) (not (= .cse3 6)) (< (+ .cse3 .cse4 .cse0 .cse1 .cse2) (+ .cse5 13)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_230| Int) (v_subst_9 Int) (v_subst_7 Int) (v_subst_11 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_230| 4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 6 .cse8)) (< (+ .cse5 11) (+ .cse9 .cse10 .cse11 .cse12 .cse8)) (not (= .cse10 6)) (not (= 6 .cse12)) (not (= .cse11 6)))))))))))) is different from false [2023-02-15 10:16:08,040 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_736 (Array Int Int)) (v_subst_8 Int) (v_subst_10 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (< (+ .cse0 .cse1 .cse2 .cse3 .cse4) (+ 19 .cse5)) (not (= .cse2 6)) (not (= .cse3 6)) (not (= 6 .cse4)) (not (= .cse0 6)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_230| Int) (v_subst_9 Int) (v_subst_7 Int) (v_subst_11 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_230| 4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse9 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 6 .cse8)) (not (= .cse9 6)) (not (= 6 .cse10)) (< (+ .cse5 17) (+ .cse11 .cse9 .cse12 .cse10 .cse8)) (not (= .cse12 6)))))))))))) is different from false [2023-02-15 10:16:08,249 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* 6 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_736 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_230| Int) (v_subst_9 Int) (v_subst_7 Int) (v_subst_11 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_230| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_11 4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_9))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_7))))) (or (not (= 6 .cse0)) (not (= .cse1 6)) (not (= 6 .cse2)) (< (+ 23 .cse3) (+ .cse4 .cse1 .cse5 .cse2 .cse0)) (not (= .cse5 6)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_12 Int) (v_ArrVal_736 (Array Int Int)) (v_subst_8 Int) (v_subst_10 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_736))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_736 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_12 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* v_subst_10 4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_8))))) (or (not (= .cse8 6)) (not (= .cse9 6)) (not (= 6 .cse10)) (not (= .cse11 6)) (< (+ .cse11 .cse12 .cse8 .cse9 .cse10) (+ .cse3 25)))))))))))) is different from false [2023-02-15 10:16:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2023-02-15 10:16:08,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212997760] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:16:08,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:16:08,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 47 [2023-02-15 10:16:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214053574] [2023-02-15 10:16:08,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:16:08,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 10:16:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:16:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 10:16:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1581, Unknown=6, NotChecked=420, Total=2162 [2023-02-15 10:16:08,342 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 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) [2023-02-15 10:16:19,344 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 197 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:28,663 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 199 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:35,851 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 199 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:47,296 WARN L233 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 121 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:49,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:59,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:04,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:19,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:17:22,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-15 10:17:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:22,799 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2023-02-15 10:17:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 10:17:22,800 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 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 45 [2023-02-15 10:17:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:22,801 INFO L225 Difference]: With dead ends: 152 [2023-02-15 10:17:22,801 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 10:17:22,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=579, Invalid=4979, Unknown=12, NotChecked=750, Total=6320 [2023-02-15 10:17:22,803 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 55 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 128 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 407 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:22,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 326 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1705 Invalid, 9 Unknown, 407 Unchecked, 19.5s Time] [2023-02-15 10:17:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 10:17:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2023-02-15 10:17:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 117 states have internal predecessors, (146), 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) [2023-02-15 10:17:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2023-02-15 10:17:22,827 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 45 [2023-02-15 10:17:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:22,827 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2023-02-15 10:17:22,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 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) [2023-02-15 10:17:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2023-02-15 10:17:22,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:17:22,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:22,828 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:22,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:23,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 10:17:23,035 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 3 times [2023-02-15 10:17:23,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:23,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392087681] [2023-02-15 10:17:23,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:23,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:23,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:23,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797105463] [2023-02-15 10:17:23,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:17:23,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:23,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:23,048 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:23,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 10:17:23,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 10:17:23,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:23,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 10:17:23,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:23,335 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 17 [2023-02-15 10:17:23,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:23,578 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 10:17:23,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:23,653 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 10:17:23,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:23,738 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-15 10:17:23,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:17:23,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 10:17:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-15 10:17:23,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:24,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:17:24,995 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2023-02-15 10:17:25,018 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-15 10:17:25,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2023-02-15 10:17:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-15 10:17:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:27,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392087681] [2023-02-15 10:17:27,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:27,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797105463] [2023-02-15 10:17:27,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797105463] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:27,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:27,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-02-15 10:17:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083948472] [2023-02-15 10:17:27,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:27,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 10:17:27,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:27,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 10:17:27,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=232, Unknown=2, NotChecked=0, Total=306 [2023-02-15 10:17:27,143 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:28,346 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2023-02-15 10:17:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:17:28,346 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-15 10:17:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:28,347 INFO L225 Difference]: With dead ends: 192 [2023-02-15 10:17:28,347 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 10:17:28,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=177, Invalid=471, Unknown=2, NotChecked=0, Total=650 [2023-02-15 10:17:28,348 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:28,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 47 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 10:17:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 10:17:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 169. [2023-02-15 10:17:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 168 states have internal predecessors, (216), 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) [2023-02-15 10:17:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 216 transitions. [2023-02-15 10:17:28,401 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 216 transitions. Word has length 45 [2023-02-15 10:17:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:28,401 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 216 transitions. [2023-02-15 10:17:28,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 216 transitions. [2023-02-15 10:17:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:17:28,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:28,402 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:28,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:28,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:28,608 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 4 times [2023-02-15 10:17:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:28,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065316124] [2023-02-15 10:17:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:28,620 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:28,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746612660] [2023-02-15 10:17:28,620 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:17:28,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:28,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:28,621 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:28,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 10:17:28,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:17:28,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:28,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 10:17:28,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:28,751 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:17:28,976 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 17 [2023-02-15 10:17:29,163 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2023-02-15 10:17:29,163 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 10:17:29,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:17:29,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 10:17:29,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 10:17:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:17:29,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:17:30,599 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 52 [2023-02-15 10:17:30,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:17:30,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 80 [2023-02-15 10:17:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:17:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:17:30,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065316124] [2023-02-15 10:17:30,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 10:17:30,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746612660] [2023-02-15 10:17:30,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746612660] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:17:30,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:17:30,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2023-02-15 10:17:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503458886] [2023-02-15 10:17:30,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 10:17:30,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 10:17:30,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:17:30,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 10:17:30,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=379, Unknown=3, NotChecked=0, Total=462 [2023-02-15 10:17:30,823 INFO L87 Difference]: Start difference. First operand 169 states and 216 transitions. Second operand has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:17:32,047 INFO L93 Difference]: Finished difference Result 202 states and 263 transitions. [2023-02-15 10:17:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:17:32,048 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-15 10:17:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:17:32,049 INFO L225 Difference]: With dead ends: 202 [2023-02-15 10:17:32,049 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 10:17:32,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=96, Invalid=453, Unknown=3, NotChecked=0, Total=552 [2023-02-15 10:17:32,050 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:17:32,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 63 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 10:17:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 10:17:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2023-02-15 10:17:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 159 states have internal predecessors, (195), 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) [2023-02-15 10:17:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 195 transitions. [2023-02-15 10:17:32,093 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 195 transitions. Word has length 45 [2023-02-15 10:17:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:17:32,094 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 195 transitions. [2023-02-15 10:17:32,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:17:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2023-02-15 10:17:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 10:17:32,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:17:32,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:17:32,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-15 10:17:32,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:32,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:17:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:17:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2023-02-15 10:17:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:17:32,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812175183] [2023-02-15 10:17:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:17:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:17:32,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 10:17:32,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857597468] [2023-02-15 10:17:32,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:17:32,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:17:32,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:17:32,308 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:17:32,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 10:17:32,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 10:17:32,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:17:32,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 10:17:32,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:17:32,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 10:17:32,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:17:32,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-15 10:17:33,071 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-15 10:17:33,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2023-02-15 10:17:33,270 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-15 10:17:33,271 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 47 [2023-02-15 10:17:33,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:17:33,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2023-02-15 10:17:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:17:34,232 INFO L328 TraceCheckSpWp]: Computing backward predicates...