./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/brs3.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 c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 21:59:17,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 21:59:17,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 21:59:17,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 21:59:17,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 21:59:17,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 21:59:17,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 21:59:17,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 21:59:17,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 21:59:17,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 21:59:17,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 21:59:17,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 21:59:17,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 21:59:17,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 21:59:17,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 21:59:17,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 21:59:17,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 21:59:17,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 21:59:17,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 21:59:17,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 21:59:17,542 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 21:59:17,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 21:59:17,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 21:59:17,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 21:59:17,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 21:59:17,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 21:59:17,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 21:59:17,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 21:59:17,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 21:59:17,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 21:59:17,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 21:59:17,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 21:59:17,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 21:59:17,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 21:59:17,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 21:59:17,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 21:59:17,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 21:59:17,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 21:59:17,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 21:59:17,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 21:59:17,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 21:59:17,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 21:59:17,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 21:59:17,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 21:59:17,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 21:59:17,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 21:59:17,590 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 21:59:17,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 21:59:17,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 21:59:17,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 21:59:17,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 21:59:17,592 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 21:59:17,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 21:59:17,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 21:59:17,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 21:59:17,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 21:59:17,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 21:59:17,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 21:59:17,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 21:59:17,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 21:59:17,594 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 21:59:17,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 21:59:17,594 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 21:59:17,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 21:59:17,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 21:59:17,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 21:59:17,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 21:59:17,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:59:17,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 21:59:17,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 21:59:17,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 21:59:17,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 21:59:17,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 21:59:17,597 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 21:59:17,597 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 21:59:17,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 21:59:17,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 [2022-07-20 21:59:17,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 21:59:17,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 21:59:17,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 21:59:17,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 21:59:17,850 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 21:59:17,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3.c [2022-07-20 21:59:17,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79de6ea45/4fae00684e4945e1ae7e94b9aa7f13ed/FLAG68823cdb0 [2022-07-20 21:59:18,286 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 21:59:18,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c [2022-07-20 21:59:18,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79de6ea45/4fae00684e4945e1ae7e94b9aa7f13ed/FLAG68823cdb0 [2022-07-20 21:59:18,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79de6ea45/4fae00684e4945e1ae7e94b9aa7f13ed [2022-07-20 21:59:18,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 21:59:18,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 21:59:18,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 21:59:18,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 21:59:18,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 21:59:18,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0c7660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18, skipping insertion in model container [2022-07-20 21:59:18,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 21:59:18,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 21:59:18,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c[587,600] [2022-07-20 21:59:18,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:59:18,874 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 21:59:18,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c[587,600] [2022-07-20 21:59:18,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 21:59:18,900 INFO L208 MainTranslator]: Completed translation [2022-07-20 21:59:18,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18 WrapperNode [2022-07-20 21:59:18,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 21:59:18,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 21:59:18,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 21:59:18,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 21:59:18,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,938 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-20 21:59:18,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 21:59:18,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 21:59:18,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 21:59:18,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 21:59:18,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 21:59:18,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 21:59:18,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 21:59:18,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 21:59:18,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (1/1) ... [2022-07-20 21:59:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 21:59:18,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:18,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 21:59:18,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 21:59:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 21:59:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 21:59:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 21:59:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 21:59:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 21:59:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 21:59:19,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 21:59:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 21:59:19,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 21:59:19,065 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 21:59:19,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 21:59:19,172 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 21:59:19,178 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 21:59:19,178 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 21:59:19,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:59:19 BoogieIcfgContainer [2022-07-20 21:59:19,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 21:59:19,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 21:59:19,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 21:59:19,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 21:59:19,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:59:18" (1/3) ... [2022-07-20 21:59:19,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6ea044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:59:19, skipping insertion in model container [2022-07-20 21:59:19,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:59:18" (2/3) ... [2022-07-20 21:59:19,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6ea044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:59:19, skipping insertion in model container [2022-07-20 21:59:19,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:59:19" (3/3) ... [2022-07-20 21:59:19,187 INFO L111 eAbstractionObserver]: Analyzing ICFG brs3.c [2022-07-20 21:59:19,199 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 21:59:19,199 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 21:59:19,236 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 21:59:19,242 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14d060d8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13fd6c08 [2022-07-20 21:59:19,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 21:59:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 21:59:19,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:19,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:19,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-20 21:59:19,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:19,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409077557] [2022-07-20 21:59:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:19,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:19,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409077557] [2022-07-20 21:59:19,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409077557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:59:19,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:59:19,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 21:59:19,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200011728] [2022-07-20 21:59:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:59:19,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 21:59:19,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:19,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 21:59:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:59:19,443 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:19,457 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-20 21:59:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 21:59:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 21:59:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:19,476 INFO L225 Difference]: With dead ends: 36 [2022-07-20 21:59:19,477 INFO L226 Difference]: Without dead ends: 16 [2022-07-20 21:59:19,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 21:59:19,481 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:19,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:59:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-20 21:59:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-20 21:59:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-20 21:59:19,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2022-07-20 21:59:19,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:19,523 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-20 21:59:19,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-07-20 21:59:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 21:59:19,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:19,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:19,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 21:59:19,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-20 21:59:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:19,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582283027] [2022-07-20 21:59:19,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:19,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:19,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582283027] [2022-07-20 21:59:19,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582283027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:59:19,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:59:19,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 21:59:19,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207474887] [2022-07-20 21:59:19,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:59:19,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 21:59:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 21:59:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:59:19,620 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:19,666 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-20 21:59:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 21:59:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 21:59:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:19,668 INFO L225 Difference]: With dead ends: 33 [2022-07-20 21:59:19,668 INFO L226 Difference]: Without dead ends: 22 [2022-07-20 21:59:19,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 21:59:19,670 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:19,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 21:59:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-20 21:59:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-20 21:59:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-20 21:59:19,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2022-07-20 21:59:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:19,676 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-20 21:59:19,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-20 21:59:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 21:59:19,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:19,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:19,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 21:59:19,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-20 21:59:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:19,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312713972] [2022-07-20 21:59:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 21:59:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:19,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312713972] [2022-07-20 21:59:19,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312713972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 21:59:19,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 21:59:19,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 21:59:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846031071] [2022-07-20 21:59:19,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 21:59:19,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 21:59:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:19,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 21:59:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 21:59:19,761 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:19,829 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-20 21:59:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 21:59:19,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-20 21:59:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:19,830 INFO L225 Difference]: With dead ends: 27 [2022-07-20 21:59:19,830 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 21:59:19,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 21:59:19,837 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:19,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 21:59:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-20 21:59:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-20 21:59:19,846 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-07-20 21:59:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:19,847 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-20 21:59:19,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-20 21:59:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 21:59:19,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:19,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:19,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 21:59:19,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-20 21:59:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:19,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551782037] [2022-07-20 21:59:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:19,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:19,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551782037] [2022-07-20 21:59:19,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551782037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:19,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794296715] [2022-07-20 21:59:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:19,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:19,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:19,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:19,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 21:59:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:20,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 21:59:20,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:20,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:20,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794296715] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:20,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:20,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 21:59:20,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685461361] [2022-07-20 21:59:20,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:20,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 21:59:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 21:59:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 21:59:20,143 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:20,240 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-07-20 21:59:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 21:59:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 21:59:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:20,241 INFO L225 Difference]: With dead ends: 43 [2022-07-20 21:59:20,242 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 21:59:20,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-20 21:59:20,244 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:20,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:20,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 21:59:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-20 21:59:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-07-20 21:59:20,249 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2022-07-20 21:59:20,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:20,249 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-07-20 21:59:20,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-07-20 21:59:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 21:59:20,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:20,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:20,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:20,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:20,474 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:20,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2022-07-20 21:59:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:20,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888854818] [2022-07-20 21:59:20,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:20,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888854818] [2022-07-20 21:59:20,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888854818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:20,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306397642] [2022-07-20 21:59:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:20,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:20,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:20,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:20,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 21:59:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:20,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 21:59:20,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:20,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 21:59:21,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-20 21:59:21,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-20 21:59:21,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-07-20 21:59:21,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-20 21:59:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:21,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:22,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_73 Int)) (or (not (<= v_ArrVal_73 0)) (<= (+ v_ArrVal_73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_73)) |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))) (* c_~N~0 3)))) is different from false [2022-07-20 21:59:25,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 210 [2022-07-20 21:59:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 21:59:25,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306397642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:25,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:25,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 27 [2022-07-20 21:59:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978183544] [2022-07-20 21:59:25,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:25,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 21:59:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 21:59:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=534, Unknown=1, NotChecked=48, Total=702 [2022-07-20 21:59:25,411 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:25,637 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-07-20 21:59:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 21:59:25,638 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 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 [2022-07-20 21:59:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:25,640 INFO L225 Difference]: With dead ends: 57 [2022-07-20 21:59:25,640 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 21:59:25,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=172, Invalid=701, Unknown=1, NotChecked=56, Total=930 [2022-07-20 21:59:25,644 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:25,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 161 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-07-20 21:59:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 21:59:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-20 21:59:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-20 21:59:25,658 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-07-20 21:59:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:25,659 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-20 21:59:25,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-20 21:59:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 21:59:25,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:25,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:25,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:25,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:25,882 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1961352373, now seen corresponding path program 2 times [2022-07-20 21:59:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:25,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929828365] [2022-07-20 21:59:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:25,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:25,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:25,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929828365] [2022-07-20 21:59:25,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929828365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:25,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641129053] [2022-07-20 21:59:25,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 21:59:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:25,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:26,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 21:59:26,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 21:59:26,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:26,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 21:59:26,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:26,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:26,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641129053] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:26,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 21:59:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622772379] [2022-07-20 21:59:26,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:26,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 21:59:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 21:59:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 21:59:26,129 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:26,298 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-07-20 21:59:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 21:59:26,299 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 21:59:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:26,300 INFO L225 Difference]: With dead ends: 77 [2022-07-20 21:59:26,300 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 21:59:26,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-07-20 21:59:26,301 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:26,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 48 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 21:59:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-07-20 21:59:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-20 21:59:26,306 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 26 [2022-07-20 21:59:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:26,306 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-20 21:59:26,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-20 21:59:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 21:59:26,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:26,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:26,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:26,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash 719394766, now seen corresponding path program 3 times [2022-07-20 21:59:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:26,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682922344] [2022-07-20 21:59:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682922344] [2022-07-20 21:59:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682922344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231837352] [2022-07-20 21:59:26,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 21:59:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:26,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:26,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 21:59:26,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 21:59:26,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:26,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 21:59:26,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:26,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 21:59:26,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:59:26,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 21:59:27,126 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 21:59:27,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 37 [2022-07-20 21:59:27,262 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:27,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-07-20 21:59:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 21:59:27,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:31,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2022-07-20 21:59:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 21:59:31,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231837352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:31,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:31,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 14] total 34 [2022-07-20 21:59:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199330382] [2022-07-20 21:59:31,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:31,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 21:59:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:31,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 21:59:31,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=908, Unknown=1, NotChecked=0, Total=1122 [2022-07-20 21:59:31,344 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:31,958 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-07-20 21:59:31,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 21:59:31,959 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 21:59:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:31,960 INFO L225 Difference]: With dead ends: 69 [2022-07-20 21:59:31,960 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 21:59:31,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=530, Invalid=2331, Unknown=1, NotChecked=0, Total=2862 [2022-07-20 21:59:31,961 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:31,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 140 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-07-20 21:59:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 21:59:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-07-20 21:59:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-07-20 21:59:31,968 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 26 [2022-07-20 21:59:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:31,968 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-07-20 21:59:31,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-07-20 21:59:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 21:59:31,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:31,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:31,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:32,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:32,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:32,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1198950171, now seen corresponding path program 4 times [2022-07-20 21:59:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:32,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179375322] [2022-07-20 21:59:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:32,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179375322] [2022-07-20 21:59:32,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179375322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:32,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355553022] [2022-07-20 21:59:32,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 21:59:32,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:32,808 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:32,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 21:59:32,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 21:59:32,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:32,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 21:59:32,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:32,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:59:33,011 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 21:59:33,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 21:59:33,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:33,107 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 21:59:33,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 21:59:33,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:33,208 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-20 21:59:33,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 51 [2022-07-20 21:59:33,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:33,309 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 21:59:33,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 40 [2022-07-20 21:59:33,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:33,439 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 21:59:33,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 15 [2022-07-20 21:59:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:33,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:34,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_183 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_183 (+ v_ArrVal_182 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_183 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_183)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 3)) (not (<= v_ArrVal_182 0))))) is different from false [2022-07-20 21:59:35,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_179 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_183 Int) (v_ArrVal_182 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_179)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_183 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_183)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* c_~N~0 3)) (not (<= v_ArrVal_179 0)) (not (<= v_ArrVal_183 (+ v_ArrVal_182 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_182 0)))))) is different from false [2022-07-20 21:59:45,439 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 21:59:45,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2056 treesize of output 2002 [2022-07-20 21:59:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-20 21:59:45,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355553022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:45,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:45,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 44 [2022-07-20 21:59:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369704499] [2022-07-20 21:59:45,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:45,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 21:59:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:45,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 21:59:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1510, Unknown=6, NotChecked=162, Total=1892 [2022-07-20 21:59:45,755 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 44 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:47,218 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-07-20 21:59:47,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 21:59:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 0 states have call successors, (0), 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 [2022-07-20 21:59:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:47,219 INFO L225 Difference]: With dead ends: 88 [2022-07-20 21:59:47,219 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 21:59:47,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=496, Invalid=3166, Unknown=6, NotChecked=238, Total=3906 [2022-07-20 21:59:47,222 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:47,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 99 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 478 Invalid, 0 Unknown, 239 Unchecked, 0.3s Time] [2022-07-20 21:59:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 21:59:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2022-07-20 21:59:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-07-20 21:59:47,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 29 [2022-07-20 21:59:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:47,228 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-07-20 21:59:47,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 44 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-07-20 21:59:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 21:59:47,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:47,229 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:47,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:47,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:47,452 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1722173266, now seen corresponding path program 5 times [2022-07-20 21:59:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:47,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559476690] [2022-07-20 21:59:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:47,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559476690] [2022-07-20 21:59:47,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559476690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:47,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602721514] [2022-07-20 21:59:47,559 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 21:59:47,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:47,561 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:47,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 21:59:47,629 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 21:59:47,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:47,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 21:59:47,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:47,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 21:59:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:47,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602721514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 21:59:47,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 21:59:47,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 21:59:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202215054] [2022-07-20 21:59:47,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 21:59:47,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 21:59:47,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 21:59:47,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 21:59:47,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 21:59:47,771 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 21:59:47,889 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-07-20 21:59:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 21:59:47,889 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 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 32 [2022-07-20 21:59:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 21:59:47,891 INFO L225 Difference]: With dead ends: 77 [2022-07-20 21:59:47,891 INFO L226 Difference]: Without dead ends: 56 [2022-07-20 21:59:47,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-07-20 21:59:47,892 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 49 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 21:59:47,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 54 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 21:59:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-20 21:59:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2022-07-20 21:59:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-07-20 21:59:47,898 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2022-07-20 21:59:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 21:59:47,898 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-07-20 21:59:47,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 21:59:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-07-20 21:59:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 21:59:47,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 21:59:47,899 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 21:59:47,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 21:59:48,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:48,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 21:59:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 21:59:48,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1273910208, now seen corresponding path program 6 times [2022-07-20 21:59:48,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 21:59:48,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215393817] [2022-07-20 21:59:48,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 21:59:48,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 21:59:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 21:59:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 21:59:48,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215393817] [2022-07-20 21:59:48,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215393817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 21:59:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213649274] [2022-07-20 21:59:48,918 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 21:59:48,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 21:59:48,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 21:59:48,919 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 21:59:48,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 21:59:48,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 21:59:48,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 21:59:48,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 21:59:48,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 21:59:49,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 21:59:49,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-20 21:59:49,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-07-20 21:59:49,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-20 21:59:49,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:49,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2022-07-20 21:59:49,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 21:59:49,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 54 [2022-07-20 21:59:49,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:49,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2022-07-20 21:59:50,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 21:59:50,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 19 [2022-07-20 21:59:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 21:59:50,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:20,831 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-20 22:00:20,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7478 treesize of output 7382 [2022-07-20 22:00:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:23,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213649274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:23,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:23,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 21] total 59 [2022-07-20 22:00:23,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558551231] [2022-07-20 22:00:23,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:23,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-20 22:00:23,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:23,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-20 22:00:23,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=2924, Unknown=12, NotChecked=0, Total=3422 [2022-07-20 22:00:23,584 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 59 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 59 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:43,666 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:00:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:47,213 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-20 22:00:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-20 22:00:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 59 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 22:00:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:47,215 INFO L225 Difference]: With dead ends: 118 [2022-07-20 22:00:47,215 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 22:00:47,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2657 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=1104, Invalid=7070, Unknown=16, NotChecked=0, Total=8190 [2022-07-20 22:00:47,217 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 87 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 758 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:47,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 92 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 605 Invalid, 0 Unknown, 758 Unchecked, 0.4s Time] [2022-07-20 22:00:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 22:00:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-07-20 22:00:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 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) [2022-07-20 22:00:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-07-20 22:00:47,232 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 35 [2022-07-20 22:00:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:47,234 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-07-20 22:00:47,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 59 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:47,234 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-07-20 22:00:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 22:00:47,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:47,237 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:47,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 22:00:47,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:47,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:47,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1970704919, now seen corresponding path program 7 times [2022-07-20 22:00:47,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:47,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188929607] [2022-07-20 22:00:47,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:47,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188929607] [2022-07-20 22:00:47,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188929607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:47,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494552428] [2022-07-20 22:00:47,552 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:00:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:47,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:00:47,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 22:00:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:47,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:00:47,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:47,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:47,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494552428] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:47,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:47,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-20 22:00:47,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812627100] [2022-07-20 22:00:47,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 22:00:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:47,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 22:00:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:00:47,778 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 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) [2022-07-20 22:00:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:47,930 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2022-07-20 22:00:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 22:00:47,931 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 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) Word has length 38 [2022-07-20 22:00:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:47,932 INFO L225 Difference]: With dead ends: 155 [2022-07-20 22:00:47,932 INFO L226 Difference]: Without dead ends: 108 [2022-07-20 22:00:47,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2022-07-20 22:00:47,936 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 126 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:47,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 35 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:00:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-20 22:00:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2022-07-20 22:00:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.141025641025641) internal successors, (89), 78 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-20 22:00:47,952 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 38 [2022-07-20 22:00:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:47,953 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-20 22:00:47,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 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) [2022-07-20 22:00:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-20 22:00:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:00:47,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:47,954 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:47,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:00:48,159 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,SelfDestructingSolverStorable10 [2022-07-20 22:00:48,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2029817088, now seen corresponding path program 8 times [2022-07-20 22:00:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:48,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254046662] [2022-07-20 22:00:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:48,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254046662] [2022-07-20 22:00:48,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254046662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:48,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862006445] [2022-07-20 22:00:48,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:00:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:48,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:00:48,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 22:00:48,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:00:48,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:00:48,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:00:48,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 22:00:48,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:00:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 22:00:48,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862006445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:00:48,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:00:48,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 22 [2022-07-20 22:00:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011648688] [2022-07-20 22:00:48,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:00:48,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 22:00:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:00:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 22:00:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 22:00:48,561 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:00:48,882 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2022-07-20 22:00:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 22:00:48,882 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 22:00:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:00:48,884 INFO L225 Difference]: With dead ends: 115 [2022-07-20 22:00:48,884 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 22:00:48,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=1153, Unknown=0, NotChecked=0, Total=1482 [2022-07-20 22:00:48,886 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:00:48,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 43 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:00:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 22:00:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 54. [2022-07-20 22:00:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-07-20 22:00:48,903 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 41 [2022-07-20 22:00:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:00:48,903 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-07-20 22:00:48,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:00:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-07-20 22:00:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:00:48,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:00:48,904 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:00:48,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 22:00:49,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:49,116 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:00:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:00:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1332664835, now seen corresponding path program 9 times [2022-07-20 22:00:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:00:49,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865712888] [2022-07-20 22:00:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:00:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:00:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:00:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:50,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:00:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865712888] [2022-07-20 22:00:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865712888] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:00:50,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604268773] [2022-07-20 22:00:50,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:00:50,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:00:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:00:50,071 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:00:50,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 22:00:50,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 22:00:50,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:00:50,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 22:00:50,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:00:50,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:00:50,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:00:50,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-20 22:00:50,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2022-07-20 22:00:50,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2022-07-20 22:00:50,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:50,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2022-07-20 22:00:51,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:00:51,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2022-07-20 22:00:51,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,196 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-20 22:00:51,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 85 [2022-07-20 22:00:51,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,416 INFO L356 Elim1Store]: treesize reduction 153, result has 0.6 percent of original size [2022-07-20 22:00:51,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 101 treesize of output 99 [2022-07-20 22:00:51,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:51,725 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-20 22:00:51,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 102 [2022-07-20 22:00:54,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:00:54,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:00:54,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:00:54,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:00:54,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 23 [2022-07-20 22:00:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:00:54,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:17,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_436 0)) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)) (not (<= v_ArrVal_438 0)) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-20 22:02:19,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_436)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_436 0)) (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (<= v_ArrVal_438 0)) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))))))) is different from false [2022-07-20 22:02:21,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_436))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_436 0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (<= v_ArrVal_438 0)) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_434 3)) (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)))))) is different from false [2022-07-20 22:02:23,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_434) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (not (<= v_ArrVal_439 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_438))) (not (<= v_ArrVal_436 0)) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (<= v_ArrVal_438 0)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2)) v_ArrVal_443) (* 3 ~N~0)) (not (<= v_ArrVal_434 3)))))) is different from false [2022-07-20 22:02:46,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_152|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_443 Int) (v_ArrVal_431 Int) (v_ArrVal_441 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_439 Int) (v_ArrVal_438 Int) (v_ArrVal_436 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_152| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_431) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_434) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_436))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_146| 4))) (or (<= (+ v_ArrVal_443 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_443)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))) (* 3 ~N~0)) (not (<= v_ArrVal_436 0)) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_152|) ~N~0)) (not (<= v_ArrVal_438 0)) (not (<= v_ArrVal_439 (+ v_ArrVal_438 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_438)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0)) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_146|) ~N~0) (< (+ 3 |v_ULTIMATE.start_main_~i~0#1_152|) ~N~0) (not (<= v_ArrVal_443 (+ v_ArrVal_441 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_441)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2 4))))) (not (<= v_ArrVal_431 0)) (not (<= v_ArrVal_441 (+ v_ArrVal_439 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_439)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse2))))) (not (<= v_ArrVal_434 3)))))))) is different from false [2022-07-20 22:02:46,449 INFO L356 Elim1Store]: treesize reduction 87, result has 10.3 percent of original size [2022-07-20 22:02:46,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 322154 treesize of output 319652 [2022-07-20 22:02:48,327 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 22:02:48,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:48,531 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,SelfDestructingSolverStorable12 [2022-07-20 22:02:48,532 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 22:02:48,535 INFO L158 Benchmark]: Toolchain (without parser) took 209837.24ms. Allocated memory was 96.5MB in the beginning and 251.7MB in the end (delta: 155.2MB). Free memory was 65.6MB in the beginning and 99.1MB in the end (delta: -33.5MB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB. [2022-07-20 22:02:48,535 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 51.9MB in the beginning and 51.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 22:02:48,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.49ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 65.4MB in the beginning and 94.8MB in the end (delta: -29.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 22:02:48,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.11ms. Allocated memory is still 119.5MB. Free memory was 94.8MB in the beginning and 93.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:02:48,536 INFO L158 Benchmark]: Boogie Preprocessor took 18.09ms. Allocated memory is still 119.5MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 22:02:48,536 INFO L158 Benchmark]: RCFGBuilder took 222.19ms. Allocated memory is still 119.5MB. Free memory was 91.9MB in the beginning and 81.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 22:02:48,536 INFO L158 Benchmark]: TraceAbstraction took 209353.05ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 81.0MB in the beginning and 99.1MB in the end (delta: -18.0MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. [2022-07-20 22:02:48,537 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 51.9MB in the beginning and 51.8MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.49ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 65.4MB in the beginning and 94.8MB in the end (delta: -29.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.11ms. Allocated memory is still 119.5MB. Free memory was 94.8MB in the beginning and 93.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.09ms. Allocated memory is still 119.5MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.19ms. Allocated memory is still 119.5MB. Free memory was 91.9MB in the beginning and 81.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 209353.05ms. Allocated memory was 119.5MB in the beginning and 251.7MB in the end (delta: 132.1MB). Free memory was 81.0MB in the beginning and 99.1MB in the end (delta: -18.0MB). Peak memory consumption was 146.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 22:02:48,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/brs3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:02:50,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:02:50,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:02:50,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:02:50,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:02:50,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:02:50,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:02:50,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:02:50,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:02:50,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:02:50,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:02:50,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:02:50,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:02:50,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:02:50,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:02:50,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:02:50,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:02:50,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:02:50,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:02:50,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:02:50,311 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:02:50,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:02:50,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:02:50,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:02:50,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:02:50,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:02:50,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:02:50,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:02:50,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:02:50,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:02:50,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:02:50,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:02:50,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:02:50,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:02:50,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:02:50,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:02:50,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:02:50,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:02:50,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:02:50,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:02:50,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:02:50,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:02:50,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-20 22:02:50,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:02:50,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:02:50,377 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:02:50,377 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:02:50,378 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:02:50,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:02:50,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:02:50,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:02:50,379 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:02:50,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:02:50,380 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:02:50,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:02:50,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:02:50,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:02:50,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:02:50,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:02:50,381 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 22:02:50,382 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 22:02:50,382 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 22:02:50,382 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:02:50,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:02:50,382 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:02:50,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:02:50,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:02:50,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:02:50,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:02:50,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:02:50,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:02:50,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:02:50,384 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:02:50,384 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 22:02:50,384 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 22:02:50,385 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:02:50,385 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:02:50,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:02:50,385 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 22:02:50,385 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> c10f08fb4b6a5b6f03e91e10a510f262e1b7fa98e124f4a160c252b3d63b04c2 [2022-07-20 22:02:50,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:02:50,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:02:50,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:02:50,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:02:50,724 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:02:50,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs3.c [2022-07-20 22:02:50,787 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df1cc87b/62c2e30d2a844f06a17f55cb2318764c/FLAGa2486013f [2022-07-20 22:02:51,157 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:02:51,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c [2022-07-20 22:02:51,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df1cc87b/62c2e30d2a844f06a17f55cb2318764c/FLAGa2486013f [2022-07-20 22:02:51,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df1cc87b/62c2e30d2a844f06a17f55cb2318764c [2022-07-20 22:02:51,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:02:51,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:02:51,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:02:51,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:02:51,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:02:51,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3656b399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51, skipping insertion in model container [2022-07-20 22:02:51,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:02:51,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:02:51,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c[587,600] [2022-07-20 22:02:51,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:02:51,723 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:02:51,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs3.c[587,600] [2022-07-20 22:02:51,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:02:51,767 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:02:51,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51 WrapperNode [2022-07-20 22:02:51,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:02:51,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:02:51,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:02:51,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:02:51,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,813 INFO L137 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2022-07-20 22:02:51,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:02:51,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:02:51,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:02:51,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:02:51,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:02:51,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:02:51,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:02:51,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:02:51,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (1/1) ... [2022-07-20 22:02:51,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:02:51,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:02:51,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 22:02:51,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 22:02:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:02:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 22:02:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 22:02:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-20 22:02:51,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:02:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 22:02:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:02:51,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:02:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-20 22:02:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 22:02:51,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 22:02:51,969 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:02:51,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:02:52,132 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:02:52,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:02:52,138 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 22:02:52,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:02:52 BoogieIcfgContainer [2022-07-20 22:02:52,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:02:52,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:02:52,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:02:52,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:02:52,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:02:51" (1/3) ... [2022-07-20 22:02:52,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d31024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:02:52, skipping insertion in model container [2022-07-20 22:02:52,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:02:51" (2/3) ... [2022-07-20 22:02:52,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d31024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:02:52, skipping insertion in model container [2022-07-20 22:02:52,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:02:52" (3/3) ... [2022-07-20 22:02:52,146 INFO L111 eAbstractionObserver]: Analyzing ICFG brs3.c [2022-07-20 22:02:52,157 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:02:52,158 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:02:52,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:02:52,209 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@55ba28f4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c7a27be [2022-07-20 22:02:52,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:02:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 22:02:52,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:52,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:52,248 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-20 22:02:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:02:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078652094] [2022-07-20 22:02:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:02:52,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:02:52,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:02:52,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 22:02:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:52,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-20 22:02:52,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:52,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:02:52,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:02:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078652094] [2022-07-20 22:02:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078652094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:02:52,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:02:52,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:02:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253306538] [2022-07-20 22:02:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:02:52,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:02:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:02:52,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:02:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:02:52,389 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:52,401 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-20 22:02:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:02:52,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 22:02:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:52,408 INFO L225 Difference]: With dead ends: 36 [2022-07-20 22:02:52,409 INFO L226 Difference]: Without dead ends: 16 [2022-07-20 22:02:52,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:02:52,414 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:52,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:02:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-20 22:02:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-20 22:02:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-20 22:02:52,440 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2022-07-20 22:02:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:52,441 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-20 22:02:52,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-07-20 22:02:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 22:02:52,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:52,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:52,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:52,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:02:52,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:52,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-20 22:02:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:02:52,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109294679] [2022-07-20 22:02:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:52,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:02:52,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:02:52,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:02:52,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 22:02:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:52,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:02:52,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:52,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:02:52,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:02:52,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109294679] [2022-07-20 22:02:52,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109294679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:02:52,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:02:52,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 22:02:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583381429] [2022-07-20 22:02:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:02:52,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 22:02:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:02:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 22:02:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 22:02:52,899 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:53,065 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-07-20 22:02:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 22:02:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 22:02:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:53,066 INFO L225 Difference]: With dead ends: 33 [2022-07-20 22:02:53,067 INFO L226 Difference]: Without dead ends: 22 [2022-07-20 22:02:53,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 22:02:53,068 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:53,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:02:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-20 22:02:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-20 22:02:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-20 22:02:53,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2022-07-20 22:02:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:53,074 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-20 22:02:53,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-20 22:02:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 22:02:53,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:53,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:53,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:53,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:02:53,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-20 22:02:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:02:53,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756368378] [2022-07-20 22:02:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:53,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:02:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:02:53,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:02:53,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 22:02:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:53,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:02:53,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:53,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:53,461 INFO L356 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-07-20 22:02:53,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-20 22:02:53,555 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 22:02:53,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 34 [2022-07-20 22:02:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 22:02:53,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 22:02:53,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:02:53,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756368378] [2022-07-20 22:02:53,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756368378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:02:53,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:02:53,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 22:02:53,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830160463] [2022-07-20 22:02:53,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:02:53,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 22:02:53,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:02:53,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 22:02:53,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 22:02:53,594 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:53,804 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-20 22:02:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 22:02:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-07-20 22:02:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:53,805 INFO L225 Difference]: With dead ends: 27 [2022-07-20 22:02:53,806 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 22:02:53,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 22:02:53,807 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:53,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:02:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 22:02:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-20 22:02:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-20 22:02:53,814 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-07-20 22:02:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:53,815 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-20 22:02:53,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-20 22:02:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 22:02:53,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:53,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:53,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:54,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:02:54,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:54,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-20 22:02:54,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:02:54,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407562013] [2022-07-20 22:02:54,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:54,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:02:54,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:02:54,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:02:54,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 22:02:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:54,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:02:54,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:54,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:02:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:54,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:02:54,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407562013] [2022-07-20 22:02:54,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407562013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:02:54,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:02:54,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-07-20 22:02:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339549601] [2022-07-20 22:02:54,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:02:54,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:02:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:02:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:02:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:02:54,414 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:02:54,831 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-07-20 22:02:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:02:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 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 20 [2022-07-20 22:02:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:02:54,832 INFO L225 Difference]: With dead ends: 48 [2022-07-20 22:02:54,832 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 22:02:54,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-07-20 22:02:54,834 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 65 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:02:54,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 20 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:02:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 22:02:54,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-07-20 22:02:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-20 22:02:54,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2022-07-20 22:02:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:02:54,838 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-20 22:02:54,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:02:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-20 22:02:54,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 22:02:54,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:02:54,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:02:54,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 22:02:55,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:02:55,049 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:02:55,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:02:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 168847774, now seen corresponding path program 1 times [2022-07-20 22:02:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:02:55,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709418689] [2022-07-20 22:02:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:02:55,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:02:55,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:02:55,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:02:55,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 22:02:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:02:55,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 22:02:55,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:02:55,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:02:55,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 22:02:55,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:02:55,419 INFO L356 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-07-20 22:02:55,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 22:02:55,604 INFO L356 Elim1Store]: treesize reduction 37, result has 26.0 percent of original size [2022-07-20 22:02:55,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 87 treesize of output 48 [2022-07-20 22:02:55,739 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-20 22:02:55,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 50 [2022-07-20 22:02:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:02:55,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:03:09,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 374 [2022-07-20 22:03:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:03:10,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:03:10,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709418689] [2022-07-20 22:03:10,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709418689] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:03:10,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:03:10,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-07-20 22:03:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779700958] [2022-07-20 22:03:10,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:03:10,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 22:03:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:03:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 22:03:10,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=362, Unknown=4, NotChecked=0, Total=462 [2022-07-20 22:03:10,533 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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) [2022-07-20 22:03:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:03:11,712 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-07-20 22:03:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:03:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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 23 [2022-07-20 22:03:11,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:03:11,715 INFO L225 Difference]: With dead ends: 46 [2022-07-20 22:03:11,715 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 22:03:11,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=220, Invalid=768, Unknown=4, NotChecked=0, Total=992 [2022-07-20 22:03:11,716 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 22:03:11,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 36 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-07-20 22:03:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 22:03:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-07-20 22:03:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:03:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-07-20 22:03:11,723 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2022-07-20 22:03:11,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:03:11,723 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-07-20 22:03:11,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 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) [2022-07-20 22:03:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-07-20 22:03:11,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 22:03:11,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:03:11,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:03:11,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:03:11,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:03:11,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:03:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:03:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1961352373, now seen corresponding path program 2 times [2022-07-20 22:03:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:03:11,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686541755] [2022-07-20 22:03:11,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:03:11,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:03:11,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:03:11,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:03:11,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 22:03:12,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:03:12,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:03:12,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 22:03:12,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:03:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:03:12,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:03:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:03:12,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 22:03:12,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686541755] [2022-07-20 22:03:12,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686541755] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:03:12,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 22:03:12,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-07-20 22:03:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146023912] [2022-07-20 22:03:12,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 22:03:12,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 22:03:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 22:03:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 22:03:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-07-20 22:03:12,661 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:03:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:03:14,581 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-20 22:03:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 22:03:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 22:03:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:03:14,583 INFO L225 Difference]: With dead ends: 118 [2022-07-20 22:03:14,583 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 22:03:14,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=484, Invalid=1586, Unknown=0, NotChecked=0, Total=2070 [2022-07-20 22:03:14,585 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 225 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:03:14,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 30 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 22:03:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 22:03:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2022-07-20 22:03:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:03:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-07-20 22:03:14,595 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 26 [2022-07-20 22:03:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:03:14,595 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-07-20 22:03:14,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:03:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-07-20 22:03:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:03:14,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:03:14,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:03:14,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-20 22:03:14,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 22:03:14,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:03:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:03:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1198950171, now seen corresponding path program 3 times [2022-07-20 22:03:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 22:03:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860780846] [2022-07-20 22:03:14,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:03:14,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 22:03:14,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 22:03:14,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 22:03:14,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 22:03:14,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:03:14,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:03:15,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 22:03:15,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:03:15,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:03:15,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:03:15,258 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 22:03:15,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:03:15,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:03:15,398 INFO L356 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2022-07-20 22:03:15,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2022-07-20 22:03:15,613 INFO L356 Elim1Store]: treesize reduction 77, result has 14.4 percent of original size [2022-07-20 22:03:15,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 71 [2022-07-20 22:03:15,790 INFO L356 Elim1Store]: treesize reduction 49, result has 21.0 percent of original size [2022-07-20 22:03:15,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 60 [2022-07-20 22:03:15,942 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-07-20 22:03:15,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 53 [2022-07-20 22:03:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:03:15,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:03:23,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| (_ BitVec 32))) (bvsle (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv0 32)))) (.cse8 ((_ extract 31 0) (_ bv0 64))) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 ((_ extract 63 32) (_ bv0 64)))) (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| .cse8) .cse4 .cse7))) (let ((.cse6 (bvadd ((_ sign_extend 32) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (concat .cse7 .cse8)))) (let ((.cse5 ((_ extract 63 32) .cse6)) (.cse3 ((_ extract 31 0) .cse6))) (bvadd ((_ sign_extend 32) (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| .cse3) .cse4 .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv8 32)))) (concat .cse5 .cse3)))))))) (concat ((_ extract 63 32) .cse0) ((_ extract 31 0) .cse0))) ((_ sign_extend 32) (bvmul c_~N~0 (_ bv3 32))))) is different from false [2022-07-20 22:03:35,684 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:03:35,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 151629042 treesize of output 151053042