./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ncomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ncomp.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 c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:48:31,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:48:31,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:48:31,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:48:31,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:48:31,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:48:31,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:48:31,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:48:31,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:48:31,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:48:31,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:48:31,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:48:31,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:48:31,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:48:31,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:48:31,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:48:31,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:48:31,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:48:31,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:48:31,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:48:31,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:48:31,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:48:31,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:48:31,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:48:31,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:48:31,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:48:31,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:48:31,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:48:31,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:48:31,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:48:31,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:48:31,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:48:31,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:48:31,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:48:31,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:48:31,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:48:31,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:48:31,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:48:31,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:48:31,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:48:31,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:48:31,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:48:31,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 10:48:31,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:48:31,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:48:31,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:48:31,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:48:31,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:48:31,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:48:31,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:48:31,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:48:31,515 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:48:31,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:48:31,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:48:31,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 10:48:31,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:48:31,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:48:31,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:48:31,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:48:31,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:48:31,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:48:31,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:48:31,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:48:31,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:48:31,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:48:31,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:48:31,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:48:31,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:48:31,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:48:31,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:48:31,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:48:31,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 10:48:31,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 10:48:31,519 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:48:31,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:48:31,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:48:31,520 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 -> c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d [2022-07-22 10:48:31,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:48:31,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:48:31,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:48:31,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:48:31,722 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:48:31,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ncomp.c [2022-07-22 10:48:31,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2253ee11/bf93a46270024091afd8127081efccde/FLAG6920779a8 [2022-07-22 10:48:32,080 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:48:32,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ncomp.c [2022-07-22 10:48:32,090 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2253ee11/bf93a46270024091afd8127081efccde/FLAG6920779a8 [2022-07-22 10:48:32,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2253ee11/bf93a46270024091afd8127081efccde [2022-07-22 10:48:32,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:48:32,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:48:32,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:48:32,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:48:32,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:48:32,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13722043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32, skipping insertion in model container [2022-07-22 10:48:32,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:48:32,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:48:32,672 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/ncomp.c[588,601] [2022-07-22 10:48:32,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:48:32,709 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:48:32,718 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/ncomp.c[588,601] [2022-07-22 10:48:32,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:48:32,747 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:48:32,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32 WrapperNode [2022-07-22 10:48:32,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:48:32,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:48:32,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:48:32,749 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:48:32,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,784 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-07-22 10:48:32,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:48:32,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:48:32,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:48:32,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:48:32,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:48:32,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:48:32,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:48:32,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:48:32,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (1/1) ... [2022-07-22 10:48:32,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:48:32,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:32,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:48:32,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:48:32,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:48:32,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 10:48:32,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 10:48:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:48:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:48:32,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:48:32,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 10:48:32,929 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:48:32,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:48:33,062 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:48:33,066 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:48:33,066 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 10:48:33,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:48:33 BoogieIcfgContainer [2022-07-22 10:48:33,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:48:33,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:48:33,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:48:33,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:48:33,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:48:32" (1/3) ... [2022-07-22 10:48:33,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de776ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:48:33, skipping insertion in model container [2022-07-22 10:48:33,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:32" (2/3) ... [2022-07-22 10:48:33,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de776ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:48:33, skipping insertion in model container [2022-07-22 10:48:33,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:48:33" (3/3) ... [2022-07-22 10:48:33,073 INFO L111 eAbstractionObserver]: Analyzing ICFG ncomp.c [2022-07-22 10:48:33,082 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:48:33,082 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:48:33,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:48:33,125 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@64ecd6a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b8c3f1a [2022-07-22 10:48:33,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:48:33,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:33,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:48:33,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:33,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:33,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-22 10:48:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:33,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790925715] [2022-07-22 10:48:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:33,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790925715] [2022-07-22 10:48:33,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790925715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:33,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:33,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:48:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384528995] [2022-07-22 10:48:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:33,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:48:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:33,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:48:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:48:33,302 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:33,312 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-22 10:48:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:48:33,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 10:48:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:33,319 INFO L225 Difference]: With dead ends: 44 [2022-07-22 10:48:33,319 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 10:48:33,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:48:33,324 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:33,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 10:48:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 10:48:33,345 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-22 10:48:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-22 10:48:33,347 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-22 10:48:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:33,347 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 10:48:33,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-22 10:48:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:48:33,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:33,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:33,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 10:48:33,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-22 10:48:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:33,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917068652] [2022-07-22 10:48:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:33,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386781026] [2022-07-22 10:48:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:33,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:33,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:33,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 10:48:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:33,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 10:48:33,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:33,638 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 10:48:33,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-07-22 10:48:33,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 10:48:33,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 10:48:33,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 10:48:33,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:33,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:33,830 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 10:48:33,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 92 [2022-07-22 10:48:33,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:33,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:33,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:33,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:33,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 93 treesize of output 86 [2022-07-22 10:48:33,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:34,015 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-22 10:48:34,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 19 [2022-07-22 10:48:34,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:34,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:48:34,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:34,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917068652] [2022-07-22 10:48:34,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:34,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386781026] [2022-07-22 10:48:34,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386781026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:34,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:34,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 10:48:34,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145564970] [2022-07-22 10:48:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:34,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 10:48:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:34,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 10:48:34,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:48:34,097 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:34,166 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-22 10:48:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 10:48:34,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 10:48:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:34,168 INFO L225 Difference]: With dead ends: 39 [2022-07-22 10:48:34,168 INFO L226 Difference]: Without dead ends: 37 [2022-07-22 10:48:34,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-22 10:48:34,171 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:34,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-22 10:48:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-22 10:48:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-22 10:48:34,180 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2022-07-22 10:48:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:34,180 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-22 10:48:34,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-22 10:48:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:48:34,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:34,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:34,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:34,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:34,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1850906398, now seen corresponding path program 1 times [2022-07-22 10:48:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:34,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247291646] [2022-07-22 10:48:34,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:34,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:34,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:34,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891122434] [2022-07-22 10:48:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:34,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:34,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:34,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 10:48:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:34,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 10:48:34,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:34,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:48:34,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247291646] [2022-07-22 10:48:34,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:34,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891122434] [2022-07-22 10:48:34,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891122434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:34,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:34,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 10:48:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519119180] [2022-07-22 10:48:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:34,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 10:48:34,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:34,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 10:48:34,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 10:48:34,490 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:34,589 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-07-22 10:48:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 10:48:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:48:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:34,591 INFO L225 Difference]: With dead ends: 62 [2022-07-22 10:48:34,591 INFO L226 Difference]: Without dead ends: 50 [2022-07-22 10:48:34,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-22 10:48:34,592 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:34,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:48:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-22 10:48:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2022-07-22 10:48:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-22 10:48:34,595 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2022-07-22 10:48:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:34,595 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-22 10:48:34,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-22 10:48:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:48:34,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:34,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:34,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:34,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-22 10:48:34,807 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:34,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1060218526, now seen corresponding path program 1 times [2022-07-22 10:48:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:34,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186955349] [2022-07-22 10:48:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:34,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:34,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:34,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1905053581] [2022-07-22 10:48:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:34,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:34,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:34,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:34,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 10:48:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:34,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 10:48:34,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:34,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186955349] [2022-07-22 10:48:34,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:34,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905053581] [2022-07-22 10:48:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905053581] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:34,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-07-22 10:48:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855565522] [2022-07-22 10:48:34,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:34,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 10:48:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 10:48:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-22 10:48:34,905 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:35,015 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-22 10:48:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 10:48:35,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:48:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:35,019 INFO L225 Difference]: With dead ends: 53 [2022-07-22 10:48:35,020 INFO L226 Difference]: Without dead ends: 44 [2022-07-22 10:48:35,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-22 10:48:35,022 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:35,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 44 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:48:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-22 10:48:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-22 10:48:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-22 10:48:35,032 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2022-07-22 10:48:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:35,032 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-22 10:48:35,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-22 10:48:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 10:48:35,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:35,033 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:35,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:35,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:35,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1120615462, now seen corresponding path program 1 times [2022-07-22 10:48:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:35,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846931320] [2022-07-22 10:48:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:35,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:35,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088026921] [2022-07-22 10:48:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:35,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:35,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:35,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:35,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 10:48:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:35,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 10:48:35,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:35,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:48:35,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846931320] [2022-07-22 10:48:35,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:35,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088026921] [2022-07-22 10:48:35,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088026921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:35,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:35,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 10:48:35,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208570251] [2022-07-22 10:48:35,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:35,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 10:48:35,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:35,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 10:48:35,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 10:48:35,379 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:35,443 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-07-22 10:48:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 10:48:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 10:48:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:35,445 INFO L225 Difference]: With dead ends: 48 [2022-07-22 10:48:35,445 INFO L226 Difference]: Without dead ends: 32 [2022-07-22 10:48:35,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:48:35,446 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:35,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-22 10:48:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-22 10:48:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-22 10:48:35,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-07-22 10:48:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:35,449 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-22 10:48:35,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-22 10:48:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:48:35,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:35,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:35,469 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-22 10:48:35,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:35,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:35,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-22 10:48:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:35,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184287630] [2022-07-22 10:48:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:35,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:35,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496211737] [2022-07-22 10:48:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:35,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:35,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:35,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:35,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 10:48:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:35,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 10:48:35,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:35,866 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-07-22 10:48:35,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-07-22 10:48:35,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 10:48:35,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 10:48:35,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 10:48:35,943 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:35,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:35,956 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 10:48:35,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 97 [2022-07-22 10:48:35,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:36,024 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 10:48:36,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 104 [2022-07-22 10:48:36,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:36,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:36,133 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-22 10:48:36,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2022-07-22 10:48:36,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:36,170 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 14 treesize of output 12 [2022-07-22 10:48:36,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:36,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:36,250 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-22 10:48:36,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 56 [2022-07-22 10:48:36,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:36,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 10:48:36,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:36,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-22 10:48:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:36,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:36,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_290 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))) is different from false [2022-07-22 10:48:36,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_290) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))) is different from false [2022-07-22 10:48:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 10:48:36,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184287630] [2022-07-22 10:48:36,494 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496211737] [2022-07-22 10:48:36,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496211737] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:36,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-22 10:48:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523411771] [2022-07-22 10:48:36,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 10:48:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:36,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 10:48:36,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=80, Unknown=2, NotChecked=38, Total=156 [2022-07-22 10:48:36,496 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:36,652 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-07-22 10:48:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 10:48:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:48:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:36,653 INFO L225 Difference]: With dead ends: 53 [2022-07-22 10:48:36,653 INFO L226 Difference]: Without dead ends: 51 [2022-07-22 10:48:36,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=169, Unknown=2, NotChecked=58, Total=306 [2022-07-22 10:48:36,654 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:36,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 113 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2022-07-22 10:48:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-22 10:48:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2022-07-22 10:48:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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-22 10:48:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-22 10:48:36,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2022-07-22 10:48:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:36,657 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-22 10:48:36,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-22 10:48:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:48:36,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:36,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:36,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:36,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:36,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash 859342364, now seen corresponding path program 2 times [2022-07-22 10:48:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:36,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021573496] [2022-07-22 10:48:36,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:36,907 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:36,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106182040] [2022-07-22 10:48:36,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:48:36,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:36,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:36,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:36,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 10:48:36,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:48:36,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:48:36,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:48:36,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:48:37,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:48:37,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:37,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021573496] [2022-07-22 10:48:37,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:37,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106182040] [2022-07-22 10:48:37,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106182040] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:37,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:37,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:48:37,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451014524] [2022-07-22 10:48:37,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:37,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:48:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:48:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:48:37,035 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:37,146 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-22 10:48:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 10:48:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:48:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:37,147 INFO L225 Difference]: With dead ends: 86 [2022-07-22 10:48:37,147 INFO L226 Difference]: Without dead ends: 68 [2022-07-22 10:48:37,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:48:37,147 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:37,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:48:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-22 10:48:37,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42. [2022-07-22 10:48:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 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-22 10:48:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-22 10:48:37,152 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2022-07-22 10:48:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:37,152 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-22 10:48:37,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-22 10:48:37,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:48:37,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:37,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:37,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:37,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:37,353 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 3 times [2022-07-22 10:48:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:37,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730857203] [2022-07-22 10:48:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:37,372 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:37,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028281137] [2022-07-22 10:48:37,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:48:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:37,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:37,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 10:48:37,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:48:37,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:48:37,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 10:48:37,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:48:37,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:48:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:37,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730857203] [2022-07-22 10:48:37,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:37,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028281137] [2022-07-22 10:48:37,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028281137] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:37,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:37,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-22 10:48:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157272069] [2022-07-22 10:48:37,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:37,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 10:48:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 10:48:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 10:48:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-22 10:48:37,527 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:37,674 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-07-22 10:48:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:48:37,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:48:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:37,674 INFO L225 Difference]: With dead ends: 71 [2022-07-22 10:48:37,674 INFO L226 Difference]: Without dead ends: 60 [2022-07-22 10:48:37,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-22 10:48:37,675 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:37,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 61 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 10:48:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-22 10:48:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-07-22 10:48:37,678 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-22 10:48:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-07-22 10:48:37,678 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2022-07-22 10:48:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:37,679 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-07-22 10:48:37,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-07-22 10:48:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:48:37,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:37,679 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:37,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:37,891 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-07-22 10:48:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 10:48:37,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104557495] [2022-07-22 10:48:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 10:48:37,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 10:48:37,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540428094] [2022-07-22 10:48:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:37,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 10:48:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:37,920 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 10:48:37,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 10:48:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:38,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-22 10:48:38,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:38,344 INFO L356 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-07-22 10:48:38,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-07-22 10:48:38,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-22 10:48:38,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-22 10:48:38,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-22 10:48:38,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-07-22 10:48:38,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:40,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:40,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:40,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:40,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1039 treesize of output 1018 [2022-07-22 10:48:40,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:40,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 1051 treesize of output 1030 [2022-07-22 10:48:40,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:40,453 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 10:48:40,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 503 treesize of output 500 [2022-07-22 10:48:40,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:40,987 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 10:48:40,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1986 treesize of output 1957 [2022-07-22 10:48:41,977 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 10:48:41,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 3 [2022-07-22 10:48:42,092 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 10:48:42,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 3 [2022-07-22 10:48:42,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-22 10:48:42,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-22 10:48:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:42,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 141 [2022-07-22 10:48:42,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:42,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-22 10:48:42,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,646 INFO L356 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-07-22 10:48:42,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 316 treesize of output 342 [2022-07-22 10:48:42,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:42,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 143 [2022-07-22 10:48:42,746 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 7 treesize of output 5 [2022-07-22 10:48:42,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 86 [2022-07-22 10:48:42,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,866 INFO L356 Elim1Store]: treesize reduction 37, result has 27.5 percent of original size [2022-07-22 10:48:42,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 316 treesize of output 342 [2022-07-22 10:48:42,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:42,929 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-22 10:48:42,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 150 [2022-07-22 10:48:42,960 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:48:42,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 10:48:42,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:42,989 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 93 treesize of output 1 [2022-07-22 10:48:43,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:43,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:43,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:43,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:43,250 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 205 treesize of output 152 [2022-07-22 10:48:43,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:43,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-07-22 10:48:43,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:43,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:43,535 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 10:48:43,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 10:48:43,576 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:48:43,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-07-22 10:48:43,597 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse22 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse41 (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (not .cse41)) (.cse47 (not .cse22)) (.cse40 (not .cse1))) (and (let ((.cse0 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (let ((.cse4 (and .cse0 (exists ((v_prenex_108 (Array Int Int)) (v_prenex_109 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_prenex_110 (Array Int Int)) (v_prenex_111 (Array Int Int)) (v_prenex_113 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse48 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_110) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_109) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_110) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_109) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33)) (.cse50 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse49 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse52 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse53 (select .cse48 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse51 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_113) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_111) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_108) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_113) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_111) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_108))) (and (= (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|) .cse49) (= c_~N~0 (select v_DerPreprocessor_33 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse49 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse49 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_prenex_108 |c_ULTIMATE.start_main_~c~0#1.offset|) c_~N~0) (= (select .cse52 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse52) (= (select .cse53 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= .cse53 (select .cse51 |c_ULTIMATE.start_main_~b~0#1.base|)))))) .cse47))) (or (and (= |c_ULTIMATE.start_main_~c~0#1.offset| |c_ULTIMATE.start_main_~b~0#1.offset|) (or (and .cse0 .cse1 (exists ((v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44))) (and (= v_DerPreprocessor_13 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (= c_~N~0 (select v_DerPreprocessor_44 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) v_DerPreprocessor_14))))) (and .cse3 (or .cse4 (and (or (exists ((v_prenex_181 (Array Int Int)) (v_prenex_160 (Array Int Int)) (v_prenex_182 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (v_prenex_185 (Array Int Int)) (v_prenex_186 (Array Int Int)) (v_prenex_188 (Array Int Int)) (v_prenex_158 (Array Int Int)) (v_prenex_159 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int))) (let ((.cse12 (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~c~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~c~0#1.base| .cse13)))) (let ((.cse7 (store (store (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_186) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_185) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_186) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_185) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158))) (let ((.cse6 (store (store (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_188) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_184) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_188) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_184) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183)) (.cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (store (store (store (store (store (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_181) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_182) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_181) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_182) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183)) (.cse9 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_159) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_160) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_159) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_160) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse8 v_prenex_186) (= (select v_prenex_183 |c_ULTIMATE.start_main_~c~0#1.offset|) c_~N~0) (= (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) v_prenex_188) (= .cse9 .cse10) (= .cse8 .cse10) (= v_prenex_159 .cse10) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) v_prenex_181) (= .cse5 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse9 v_DerPreprocessor_37) (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) (= (select v_prenex_158 |c_ULTIMATE.start_main_~c~0#1.offset|) c_~N~0)))))) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse20 (let ((.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~c~0#1.base| .cse21) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~c~0#1.base| .cse21)))) (let ((.cse18 (store (store (store (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_23) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_22) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_23) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_22) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180))) (let ((.cse15 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse17 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_187) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_187) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30)) (.cse16 (store (store (store (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_178) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_179) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_178) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_179) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180)) (.cse14 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse19 (store (store (store (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select .cse14 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select .cse15 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) .cse15) (= (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) .cse15) (= c_~N~0 (select v_prenex_180 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= v_DerPreprocessor_28 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) v_prenex_23) (= v_prenex_178 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)) (= c_~N~0 (select v_DerPreprocessor_30 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse14 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_10 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_37))))))) .cse0 .cse22))))) (and .cse3 (or (and (or (and .cse0 (or (exists ((v_prenex_181 (Array Int Int)) (v_prenex_160 (Array Int Int)) (v_prenex_182 (Array Int Int)) (v_prenex_183 (Array Int Int)) (v_prenex_184 (Array Int Int)) (v_prenex_185 (Array Int Int)) (v_prenex_186 (Array Int Int)) (v_prenex_188 (Array Int Int)) (v_prenex_158 (Array Int Int)) (v_prenex_159 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse30 (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~c~0#1.base| .cse31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~c~0#1.base| .cse31)))) (let ((.cse28 (store (store (store (store (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_186) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_185) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_186) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_185) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158))) (let ((.cse25 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse27 (store (store (store (store (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_181) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_182) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_181) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_182) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183)) (.cse26 (store (store (store (store (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_188) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_184) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_188) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_184) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_183)) (.cse23 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse29 (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_159) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_160) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_159) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_160) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_158) |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse23 .cse24) (= (select .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) v_prenex_188) (= (select .cse27 |c_ULTIMATE.start_main_~b~0#1.base|) .cse25) (= (select v_prenex_183 |c_ULTIMATE.start_main_~c~0#1.offset|) c_~N~0) (= v_prenex_181 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse29 v_prenex_186) (= .cse23 v_DerPreprocessor_50) (= v_prenex_159 .cse24) (= .cse29 .cse24) (= (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) (= (select v_prenex_158 |c_ULTIMATE.start_main_~c~0#1.offset|) c_~N~0)))))) (exists ((v_prenex_180 (Array Int Int)) (v_prenex_187 (Array Int Int)) (v_prenex_178 (Array Int Int)) (v_prenex_179 (Array Int Int)) (v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse32 (let ((.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~c~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_main_~c~0#1.base| .cse39)))) (let ((.cse37 (store (store (store (store (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_178) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_179) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_178) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_179) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180)) (.cse36 (store (store (store (store (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_23) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_22) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180) |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_23) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_22) |c_ULTIMATE.start_main_~c~0#1.base| v_prenex_180))) (let ((.cse35 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_187) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_187) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30)) (.cse38 (store (store (store (store (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_30)) (.cse34 (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse33 (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) (= (select .cse34 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= c_~N~0 (select v_prenex_180 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= v_DerPreprocessor_28 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse34) (= v_prenex_23 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|) .cse33) (= v_prenex_178 (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10) (= (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) .cse34) (= c_~N~0 (select v_DerPreprocessor_30 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_50) (= (select .cse33 |c_ULTIMATE.start_main_~b~0#1.offset|) 1))))))) .cse22) .cse4) .cse40) (and .cse0 .cse1))) (and .cse41 (or (and (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse46 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_46))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse43 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_49))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse42 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~c~0#1.base| .cse45) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_main_~c~0#1.base| .cse45))) (and (= (select .cse42 |c_ULTIMATE.start_main_~b~0#1.base|) v_DerPreprocessor_14) (= v_DerPreprocessor_48 (select .cse43 |c_ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_47 .cse44) (= (select .cse45 |c_ULTIMATE.start_main_~c~0#1.offset|) c_~N~0) (= (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) .cse44) (= v_DerPreprocessor_13 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|))))))) .cse0 .cse1) (and .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) .cse47)))))) .cse3 .cse47 .cse40))) is different from true [2022-07-22 10:48:43,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:43,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:43,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:43,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 102 [2022-07-22 10:48:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 10:48:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104557495] [2022-07-22 10:48:43,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 10:48:43,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540428094] [2022-07-22 10:48:43,637 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 10:48:43,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:48:43,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-22 10:48:43,855 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) 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:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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-22 10:48:43,858 INFO L158 Benchmark]: Toolchain (without parser) took 11340.77ms. Allocated memory was 107.0MB in the beginning and 272.6MB in the end (delta: 165.7MB). Free memory was 74.6MB in the beginning and 135.3MB in the end (delta: -60.7MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2022-07-22 10:48:43,859 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 10:48:43,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.30ms. Allocated memory is still 107.0MB. Free memory was 74.6MB in the beginning and 82.1MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 10:48:43,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.10ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 10:48:43,859 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 78.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 10:48:43,859 INFO L158 Benchmark]: RCFGBuilder took 247.58ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 66.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 10:48:43,859 INFO L158 Benchmark]: TraceAbstraction took 10789.10ms. Allocated memory was 107.0MB in the beginning and 272.6MB in the end (delta: 165.7MB). Free memory was 66.3MB in the beginning and 135.3MB in the end (delta: -69.0MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2022-07-22 10:48:43,860 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.15ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.30ms. Allocated memory is still 107.0MB. Free memory was 74.6MB in the beginning and 82.1MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.10ms. Allocated memory is still 107.0MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 78.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.58ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 66.8MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10789.10ms. Allocated memory was 107.0MB in the beginning and 272.6MB in the end (delta: 165.7MB). Free memory was 66.3MB in the beginning and 135.3MB in the end (delta: -69.0MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 10:48:43,874 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/ncomp.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 c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 10:48:45,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 10:48:45,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 10:48:45,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 10:48:45,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 10:48:45,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 10:48:45,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 10:48:45,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 10:48:45,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 10:48:45,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 10:48:45,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 10:48:45,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 10:48:45,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 10:48:45,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 10:48:45,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 10:48:45,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 10:48:45,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 10:48:45,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 10:48:45,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 10:48:45,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 10:48:45,553 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 10:48:45,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 10:48:45,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 10:48:45,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 10:48:45,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 10:48:45,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 10:48:45,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 10:48:45,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 10:48:45,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 10:48:45,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 10:48:45,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 10:48:45,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 10:48:45,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 10:48:45,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 10:48:45,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 10:48:45,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 10:48:45,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 10:48:45,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 10:48:45,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 10:48:45,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 10:48:45,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 10:48:45,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 10:48:45,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 10:48:45,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 10:48:45,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 10:48:45,591 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 10:48:45,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 10:48:45,592 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 10:48:45,592 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 10:48:45,592 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 10:48:45,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 10:48:45,593 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 10:48:45,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 10:48:45,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 10:48:45,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 10:48:45,594 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 10:48:45,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 10:48:45,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 10:48:45,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 10:48:45,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 10:48:45,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 10:48:45,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 10:48:45,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 10:48:45,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:48:45,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 10:48:45,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 10:48:45,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 10:48:45,596 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 10:48:45,596 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 10:48:45,597 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 10:48:45,597 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 10:48:45,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 10:48:45,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 10:48:45,597 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 -> c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d [2022-07-22 10:48:45,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 10:48:45,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 10:48:45,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 10:48:45,867 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 10:48:45,867 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 10:48:45,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ncomp.c [2022-07-22 10:48:45,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01b9832e/f174dcd24a4e40e085b84f9c5eb74551/FLAG29dd3f274 [2022-07-22 10:48:46,235 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 10:48:46,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ncomp.c [2022-07-22 10:48:46,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01b9832e/f174dcd24a4e40e085b84f9c5eb74551/FLAG29dd3f274 [2022-07-22 10:48:46,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01b9832e/f174dcd24a4e40e085b84f9c5eb74551 [2022-07-22 10:48:46,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 10:48:46,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 10:48:46,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 10:48:46,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 10:48:46,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 10:48:46,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331f7f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46, skipping insertion in model container [2022-07-22 10:48:46,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 10:48:46,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 10:48:46,399 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/ncomp.c[588,601] [2022-07-22 10:48:46,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:48:46,486 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 10:48:46,503 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/ncomp.c[588,601] [2022-07-22 10:48:46,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 10:48:46,538 INFO L208 MainTranslator]: Completed translation [2022-07-22 10:48:46,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46 WrapperNode [2022-07-22 10:48:46,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 10:48:46,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 10:48:46,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 10:48:46,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 10:48:46,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,576 INFO L137 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-07-22 10:48:46,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 10:48:46,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 10:48:46,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 10:48:46,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 10:48:46,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 10:48:46,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 10:48:46,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 10:48:46,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 10:48:46,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (1/1) ... [2022-07-22 10:48:46,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 10:48:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 10:48:46,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 10:48:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 10:48:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 10:48:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-22 10:48:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 10:48:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 10:48:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 10:48:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-22 10:48:46,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 10:48:46,736 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 10:48:46,741 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 10:48:47,060 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 10:48:47,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 10:48:47,064 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 10:48:47,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:48:47 BoogieIcfgContainer [2022-07-22 10:48:47,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 10:48:47,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 10:48:47,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 10:48:47,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 10:48:47,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:48:46" (1/3) ... [2022-07-22 10:48:47,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f34873b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:48:47, skipping insertion in model container [2022-07-22 10:48:47,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:48:46" (2/3) ... [2022-07-22 10:48:47,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f34873b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:48:47, skipping insertion in model container [2022-07-22 10:48:47,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:48:47" (3/3) ... [2022-07-22 10:48:47,075 INFO L111 eAbstractionObserver]: Analyzing ICFG ncomp.c [2022-07-22 10:48:47,083 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 10:48:47,095 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 10:48:47,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 10:48:47,130 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@6aaeeb56, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bb80988 [2022-07-22 10:48:47,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 10:48:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:48:47,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:47,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:47,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-22 10:48:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:48:47,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383273754] [2022-07-22 10:48:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:48:47,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:48:47,157 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-22 10:48:47,158 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-22 10:48:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:47,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 10:48:47,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:47,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:48:47,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:48:47,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383273754] [2022-07-22 10:48:47,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383273754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:47,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:47,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 10:48:47,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6668966] [2022-07-22 10:48:47,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:47,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 10:48:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:48:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 10:48:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:48:47,317 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:47,330 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-22 10:48:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 10:48:47,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 10:48:47,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:47,337 INFO L225 Difference]: With dead ends: 44 [2022-07-22 10:48:47,337 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 10:48:47,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 10:48:47,342 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:47,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 10:48:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 10:48:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-22 10:48:47,362 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-22 10:48:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-22 10:48:47,364 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-22 10:48:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:47,364 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-22 10:48:47,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-22 10:48:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 10:48:47,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:47,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:47,391 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-22 10:48:47,583 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-22 10:48:47,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-22 10:48:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:48:47,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230510304] [2022-07-22 10:48:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:47,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:48:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:48:47,588 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-22 10:48:47,588 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-22 10:48:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:47,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 10:48:47,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:48,265 INFO L356 Elim1Store]: treesize reduction 171, result has 27.2 percent of original size [2022-07-22 10:48:48,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 256 [2022-07-22 10:48:48,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:48:48,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:48:48,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:48:48,548 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:48,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:48,581 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-22 10:48:48,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 105 [2022-07-22 10:48:48,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:48:48,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:48,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:48,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:48,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 94 treesize of output 85 [2022-07-22 10:48:48,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:48,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:48:48,996 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-22 10:48:49,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:49,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:48:49,208 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:48:49,209 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 1 case distinctions, treesize of input 57 treesize of output 33 [2022-07-22 10:48:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:49,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 10:48:49,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:48:49,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230510304] [2022-07-22 10:48:49,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230510304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 10:48:49,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 10:48:49,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 10:48:49,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889739873] [2022-07-22 10:48:49,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 10:48:49,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 10:48:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:48:49,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 10:48:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-22 10:48:49,233 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:49,942 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-22 10:48:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 10:48:49,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-22 10:48:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:49,944 INFO L225 Difference]: With dead ends: 43 [2022-07-22 10:48:49,944 INFO L226 Difference]: Without dead ends: 21 [2022-07-22 10:48:49,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:48:49,945 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:49,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 42 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 10:48:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-22 10:48:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-22 10:48:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-22 10:48:49,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2022-07-22 10:48:49,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:49,953 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-22 10:48:49,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-22 10:48:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 10:48:49,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:49,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:49,975 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-22 10:48:50,164 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-22 10:48:50,165 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:50,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:50,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1060218526, now seen corresponding path program 1 times [2022-07-22 10:48:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:48:50,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327747130] [2022-07-22 10:48:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:50,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:48:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:48:50,168 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-22 10:48:50,169 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-22 10:48:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:50,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 10:48:50,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:50,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:50,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:48:50,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327747130] [2022-07-22 10:48:50,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327747130] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:50,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:50,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-07-22 10:48:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575832978] [2022-07-22 10:48:50,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:50,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 10:48:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:48:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 10:48:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-07-22 10:48:50,588 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:51,623 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-07-22 10:48:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 10:48:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-22 10:48:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:51,635 INFO L225 Difference]: With dead ends: 61 [2022-07-22 10:48:51,635 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 10:48:51,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2022-07-22 10:48:51,636 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:51,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 29 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 10:48:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 10:48:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-07-22 10:48:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-22 10:48:51,641 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2022-07-22 10:48:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:51,641 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-22 10:48:51,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-22 10:48:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 10:48:51,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:51,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:51,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-22 10:48:51,847 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-22 10:48:51,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:51,847 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-22 10:48:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:48:51,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689319927] [2022-07-22 10:48:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:48:51,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:48:51,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:48:51,849 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-22 10:48:51,850 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-22 10:48:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:48:52,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 10:48:52,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:48:52,209 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:48:52,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-22 10:48:52,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-22 10:48:52,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:48:52,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-22 10:48:52,446 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 27 treesize of output 27 [2022-07-22 10:48:52,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:48:52,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:48:52,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2022-07-22 10:48:52,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:48:52,687 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 1 case distinctions, treesize of input 57 treesize of output 33 [2022-07-22 10:48:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:52,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:48:56,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:56,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:48:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:48:56,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:48:56,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689319927] [2022-07-22 10:48:56,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689319927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:48:56,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:48:56,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-07-22 10:48:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201585818] [2022-07-22 10:48:56,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:48:56,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 10:48:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:48:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 10:48:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=328, Unknown=3, NotChecked=0, Total=420 [2022-07-22 10:48:56,787 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:48:59,410 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-07-22 10:48:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 10:48:59,422 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 10:48:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:48:59,422 INFO L225 Difference]: With dead ends: 58 [2022-07-22 10:48:59,422 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 10:48:59,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=261, Invalid=792, Unknown=3, NotChecked=0, Total=1056 [2022-07-22 10:48:59,424 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 83 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:48:59,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 121 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 195 Invalid, 0 Unknown, 85 Unchecked, 1.5s Time] [2022-07-22 10:48:59,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 10:48:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-07-22 10:48:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-07-22 10:48:59,429 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 20 [2022-07-22 10:48:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:48:59,429 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-07-22 10:48:59,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:48:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-07-22 10:48:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-22 10:48:59,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:48:59,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:48:59,439 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-22 10:48:59,630 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-22 10:48:59,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:48:59,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:48:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 2 times [2022-07-22 10:48:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:48:59,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759486227] [2022-07-22 10:48:59,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:48:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:48:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:48:59,633 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-22 10:48:59,634 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-22 10:48:59,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:48:59,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:48:59,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 10:48:59,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:49:00,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:49:00,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:49:00,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759486227] [2022-07-22 10:49:00,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759486227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:00,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:49:00,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2022-07-22 10:49:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233535222] [2022-07-22 10:49:00,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:00,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 10:49:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:49:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 10:49:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-07-22 10:49:00,432 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:02,309 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-07-22 10:49:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 10:49:02,321 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-22 10:49:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:02,322 INFO L225 Difference]: With dead ends: 105 [2022-07-22 10:49:02,322 INFO L226 Difference]: Without dead ends: 88 [2022-07-22 10:49:02,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=360, Invalid=1046, Unknown=0, NotChecked=0, Total=1406 [2022-07-22 10:49:02,323 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 247 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:02,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 64 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-22 10:49:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-22 10:49:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2022-07-22 10:49:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-07-22 10:49:02,332 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 22 [2022-07-22 10:49:02,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:02,333 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-07-22 10:49:02,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:02,333 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-07-22 10:49:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 10:49:02,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:02,334 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:02,342 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-22 10:49:02,534 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-22 10:49:02,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-07-22 10:49:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:49:02,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149504400] [2022-07-22 10:49:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 10:49:02,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:49:02,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:49:02,536 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-22 10:49:02,537 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-22 10:49:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 10:49:03,379 WARN L261 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-22 10:49:03,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:03,439 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:49:03,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2022-07-22 10:49:03,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:03,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-07-22 10:49:03,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,490 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 10:49:03,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 46 [2022-07-22 10:49:03,625 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 10:49:03,625 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 42 treesize of output 42 [2022-07-22 10:49:03,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 11 [2022-07-22 10:49:03,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2022-07-22 10:49:03,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:03,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2022-07-22 10:49:06,669 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-22 10:49:06,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 63 [2022-07-22 10:49:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:06,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:26,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:26,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:26,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:26,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:26,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:26,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:26,253 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 10:49:26,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 856 treesize of output 1 [2022-07-22 10:49:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:26,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:49:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149504400] [2022-07-22 10:49:26,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149504400] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:26,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:49:26,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-07-22 10:49:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613112987] [2022-07-22 10:49:26,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 10:49:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:49:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 10:49:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-07-22 10:49:26,258 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:31,825 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-07-22 10:49:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 10:49:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 10:49:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:31,826 INFO L225 Difference]: With dead ends: 62 [2022-07-22 10:49:31,826 INFO L226 Difference]: Without dead ends: 45 [2022-07-22 10:49:31,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 10:49:31,827 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:31,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 70 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 142 Invalid, 0 Unknown, 86 Unchecked, 2.5s Time] [2022-07-22 10:49:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-22 10:49:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-22 10:49:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-22 10:49:31,849 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2022-07-22 10:49:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:31,850 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-22 10:49:31,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-22 10:49:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-22 10:49:31,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:31,850 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:31,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 10:49:32,051 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-22 10:49:32,051 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 3 times [2022-07-22 10:49:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:49:32,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369742272] [2022-07-22 10:49:32,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:49:32,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:49:32,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:49:32,053 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-22 10:49:32,053 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-22 10:49:32,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:49:32,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:49:32,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 10:49:32,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:32,888 INFO L356 Elim1Store]: treesize reduction 171, result has 27.2 percent of original size [2022-07-22 10:49:32,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 308 [2022-07-22 10:49:32,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:32,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:32,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:49:32,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:32,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:32,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:49:32,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:32,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 10:49:33,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,767 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-22 10:49:33,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 62 [2022-07-22 10:49:33,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:49:33,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:49:33,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:33,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:33,839 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-22 10:49:33,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 237 [2022-07-22 10:49:33,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:49:33,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:49:33,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:33,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 11 [2022-07-22 10:49:33,992 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:49:33,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-22 10:49:34,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-22 10:49:34,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-22 10:49:34,388 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 27 treesize of output 27 [2022-07-22 10:49:34,433 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 27 treesize of output 27 [2022-07-22 10:49:34,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:49:34,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2022-07-22 10:49:34,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:34,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:49:34,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2022-07-22 10:49:34,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:49:34,842 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 1 case distinctions, treesize of input 57 treesize of output 33 [2022-07-22 10:49:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:49:34,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:49:40,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:40,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 10:49:40,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:49:40,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369742272] [2022-07-22 10:49:40,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369742272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:49:40,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:49:40,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2022-07-22 10:49:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323252631] [2022-07-22 10:49:40,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:49:40,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 10:49:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:49:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 10:49:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=598, Unknown=6, NotChecked=0, Total=756 [2022-07-22 10:49:40,647 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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-22 10:49:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:49:49,831 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-22 10:49:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-22 10:49:49,844 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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 26 [2022-07-22 10:49:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:49:49,845 INFO L225 Difference]: With dead ends: 110 [2022-07-22 10:49:49,845 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 10:49:49,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=543, Invalid=2097, Unknown=12, NotChecked=0, Total=2652 [2022-07-22 10:49:49,846 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 108 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:49:49,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 159 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 229 Invalid, 0 Unknown, 313 Unchecked, 2.4s Time] [2022-07-22 10:49:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 10:49:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2022-07-22 10:49:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.127906976744186) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:49:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2022-07-22 10:49:49,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2022-07-22 10:49:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:49:49,854 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2022-07-22 10:49:49,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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-22 10:49:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2022-07-22 10:49:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:49:49,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:49:49,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:49:49,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-22 10:49:50,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 10:49:50,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:49:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:49:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 2 times [2022-07-22 10:49:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:49:50,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098631300] [2022-07-22 10:49:50,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 10:49:50,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:49:50,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:49:50,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 10:49:50,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 10:49:50,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 10:49:50,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:49:50,844 WARN L261 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-22 10:49:50,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:49:50,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:50,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:50,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:50,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:50,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:50,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:50,926 INFO L356 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2022-07-22 10:49:50,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 43 [2022-07-22 10:49:50,970 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-22 10:49:50,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2022-07-22 10:49:50,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:50,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 15 treesize of output 9 [2022-07-22 10:49:51,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 20 [2022-07-22 10:49:51,098 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:49:51,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-22 10:49:51,374 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 10:49:51,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 37 [2022-07-22 10:49:51,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-22 10:49:51,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 48 [2022-07-22 10:49:51,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2022-07-22 10:49:51,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:51,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:49:51,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:51,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 101 [2022-07-22 10:49:52,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:49:52,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 93 [2022-07-22 10:49:56,029 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-22 10:49:56,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 63 [2022-07-22 10:49:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:49:56,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:50:38,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:50:38,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:50:38,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:50:38,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:50:38,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:50:38,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:50:38,873 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 10:50:38,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 892 treesize of output 1 [2022-07-22 10:50:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:50:38,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:50:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098631300] [2022-07-22 10:50:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098631300] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:50:38,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:50:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-07-22 10:50:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302805317] [2022-07-22 10:50:38,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:50:38,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-22 10:50:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:50:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-22 10:50:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1188, Unknown=5, NotChecked=0, Total=1406 [2022-07-22 10:50:38,879 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 38 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:51:04,446 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-07-22 10:51:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-22 10:51:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 10:51:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:51:04,447 INFO L225 Difference]: With dead ends: 97 [2022-07-22 10:51:04,447 INFO L226 Difference]: Without dead ends: 95 [2022-07-22 10:51:04,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 66.5s TimeCoverageRelationStatistics Valid=368, Invalid=2174, Unknown=8, NotChecked=0, Total=2550 [2022-07-22 10:51:04,448 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-22 10:51:04,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 115 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 169 Unchecked, 3.4s Time] [2022-07-22 10:51:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-22 10:51:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-22 10:51:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.10989010989011) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-22 10:51:04,458 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 30 [2022-07-22 10:51:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:51:04,458 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-22 10:51:04,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-22 10:51:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-22 10:51:04,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:51:04,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:51:04,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-22 10:51:04,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 10:51:04,673 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:51:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:51:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash 309331156, now seen corresponding path program 4 times [2022-07-22 10:51:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:51:04,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067474626] [2022-07-22 10:51:04,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 10:51:04,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:51:04,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:51:04,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 10:51:04,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 10:51:04,819 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 10:51:04,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:51:04,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 10:51:04,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:51:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:51:05,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:51:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 10:51:05,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:51:05,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067474626] [2022-07-22 10:51:05,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067474626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:51:05,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:51:05,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-07-22 10:51:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747434706] [2022-07-22 10:51:05,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:51:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 10:51:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:51:05,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 10:51:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2022-07-22 10:51:05,927 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:51:10,688 INFO L93 Difference]: Finished difference Result 191 states and 216 transitions. [2022-07-22 10:51:10,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-22 10:51:10,689 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-22 10:51:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:51:10,689 INFO L225 Difference]: With dead ends: 191 [2022-07-22 10:51:10,689 INFO L226 Difference]: Without dead ends: 156 [2022-07-22 10:51:10,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=706, Invalid=2264, Unknown=0, NotChecked=0, Total=2970 [2022-07-22 10:51:10,691 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 319 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-22 10:51:10,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 121 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-22 10:51:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-22 10:51:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 86. [2022-07-22 10:51:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2022-07-22 10:51:10,700 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 30 [2022-07-22 10:51:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:51:10,700 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2022-07-22 10:51:10,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2022-07-22 10:51:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 10:51:10,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:51:10,701 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:51:10,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-22 10:51:10,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 10:51:10,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:51:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:51:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 5 times [2022-07-22 10:51:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:51:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973716208] [2022-07-22 10:51:10,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-22 10:51:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:51:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:51:10,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 10:51:10,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 10:51:12,203 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-22 10:51:12,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:51:12,235 WARN L261 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-22 10:51:12,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:51:12,284 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:51:12,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-22 10:51:12,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:12,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:12,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:12,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 53 [2022-07-22 10:51:12,453 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 10:51:12,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 56 [2022-07-22 10:51:12,617 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 41 treesize of output 42 [2022-07-22 10:51:12,872 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:51:12,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-07-22 10:51:13,192 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 10:51:13,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2022-07-22 10:51:13,364 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 27 treesize of output 27 [2022-07-22 10:51:13,457 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 27 treesize of output 27 [2022-07-22 10:51:13,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,613 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:51:13,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2022-07-22 10:51:13,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:51:13,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 52 [2022-07-22 10:51:13,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:13,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:51:13,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 45 [2022-07-22 10:51:13,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 10:51:13,909 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 1 case distinctions, treesize of input 57 treesize of output 33 [2022-07-22 10:51:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:51:13,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:51:23,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:23,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:23,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:23,423 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-07-22 10:51:23,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 212 treesize of output 1 [2022-07-22 10:51:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:51:23,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:51:23,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973716208] [2022-07-22 10:51:23,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973716208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:51:23,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:51:23,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2022-07-22 10:51:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479771072] [2022-07-22 10:51:23,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:51:23,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-22 10:51:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:51:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-22 10:51:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1153, Unknown=1, NotChecked=0, Total=1482 [2022-07-22 10:51:23,428 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 39 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:26,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|))) ((_ sign_extend 32) c_~N~0)))) (.cse1 ((_ sign_extend 32) c_~N~0))) (and (or .cse0 (not (bvslt (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|) .cse1))) (or .cse0 (not (bvslt (_ bv3 64) .cse1))))) is different from false [2022-07-22 10:51:26,942 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|))) ((_ sign_extend 32) c_~N~0)))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse1 ((_ sign_extend 32) c_~N~0))) (and (or .cse0 (not (bvslt (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64)) .cse1))) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (or .cse0 (not (bvslt (bvadd (_ bv2 64) |c_ULTIMATE.start_main_~i~0#1|) .cse1))) (bvslt (_ bv3 64) .cse1) (not (bvslt (_ bv4 64) .cse1)) (= ((_ extract 63 32) .cse1) (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|))) (= (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) ((_ extract 31 0) .cse1)))) is different from false [2022-07-22 10:51:27,118 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse0 (forall ((v_ArrVal_565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~c~0#1.base|))) (concat (select .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|)) (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|))) ((_ sign_extend 32) c_~N~0)))) (.cse1 ((_ sign_extend 32) c_~N~0))) (and (or .cse0 (not (bvslt (bvadd |c_ULTIMATE.start_main_~i~0#1| (_ bv1 64)) .cse1))) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (bvslt (_ bv3 64) .cse1) (not (bvslt (_ bv4 64) .cse1)) (= ((_ extract 63 32) .cse1) (select .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~c~0#1.offset|))) (= (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) ((_ extract 31 0) .cse1)) (or .cse0 (not (bvslt |c_ULTIMATE.start_main_~i~0#1| .cse1))))) is different from false [2022-07-22 10:51:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 10:51:32,516 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2022-07-22 10:51:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-22 10:51:32,535 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 39 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 10:51:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 10:51:32,535 INFO L225 Difference]: With dead ends: 145 [2022-07-22 10:51:32,535 INFO L226 Difference]: Without dead ends: 143 [2022-07-22 10:51:32,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=619, Invalid=2344, Unknown=19, NotChecked=324, Total=3306 [2022-07-22 10:51:32,536 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-22 10:51:32,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 126 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 106 Unchecked, 2.7s Time] [2022-07-22 10:51:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-22 10:51:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2022-07-22 10:51:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.1328125) internal successors, (145), 128 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2022-07-22 10:51:32,551 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 32 [2022-07-22 10:51:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 10:51:32,552 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2022-07-22 10:51:32,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 39 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 10:51:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2022-07-22 10:51:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-22 10:51:32,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 10:51:32,553 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 10:51:32,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-22 10:51:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 10:51:32,755 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 10:51:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 10:51:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 505093188, now seen corresponding path program 3 times [2022-07-22 10:51:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 10:51:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805334397] [2022-07-22 10:51:32,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 10:51:32,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 10:51:32,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 10:51:32,757 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 10:51:32,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-22 10:51:34,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 10:51:34,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 10:51:34,112 WARN L261 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-22 10:51:34,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 10:51:34,194 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:51:34,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-22 10:51:34,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:34,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-22 10:51:34,250 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 43 treesize of output 44 [2022-07-22 10:51:34,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:34,447 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:51:34,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 70 [2022-07-22 10:51:34,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:34,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:34,689 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:51:34,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 70 [2022-07-22 10:51:35,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:35,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:35,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:35,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:35,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:35,263 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:51:35,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 16 case distinctions, treesize of input 156 treesize of output 107 [2022-07-22 10:51:35,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:35,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:51:35,672 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:51:35,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 89 treesize of output 99 [2022-07-22 10:51:36,048 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-22 10:51:36,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 112 [2022-07-22 10:51:36,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:36,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:36,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:36,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:36,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:36,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:51:36,456 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-22 10:51:36,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 137 treesize of output 125 [2022-07-22 10:51:41,235 INFO L356 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2022-07-22 10:51:41,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 16 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 30 case distinctions, treesize of input 197 treesize of output 109 [2022-07-22 10:51:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:51:41,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 10:52:35,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:35,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:35,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:35,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:35,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 10:52:35,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 10:52:35,683 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-22 10:52:35,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 3406 treesize of output 1 [2022-07-22 10:52:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 10:52:35,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 10:52:35,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805334397] [2022-07-22 10:52:35,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805334397] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 10:52:35,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 10:52:35,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 41 [2022-07-22 10:52:35,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012705808] [2022-07-22 10:52:35,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 10:52:35,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-22 10:52:35,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 10:52:35,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-22 10:52:35,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1322, Unknown=94, NotChecked=0, Total=1640 [2022-07-22 10:52:35,688 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 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)