./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/loops/eureka_01-1.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 a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:43:19,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:43:19,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:43:19,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:43:19,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:43:19,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:43:19,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:43:19,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:43:19,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:43:19,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:43:19,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:43:19,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:43:19,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:43:19,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:43:19,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:43:19,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:43:19,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:43:19,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:43:19,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:43:19,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:43:19,244 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:43:19,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:43:19,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:43:19,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:43:19,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:43:19,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:43:19,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:43:19,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:43:19,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:43:19,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:43:19,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:43:19,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:43:19,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:43:19,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:43:19,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:43:19,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:43:19,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:43:19,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:43:19,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:43:19,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:43:19,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:43:19,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:43:19,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:43:19,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:43:19,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:43:19,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:43:19,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:43:19,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:43:19,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:43:19,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:43:19,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:43:19,278 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:43:19,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:43:19,279 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:43:19,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:43:19,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:43:19,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:43:19,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:43:19,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:43:19,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:43:19,280 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:43:19,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:43:19,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:43:19,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:43:19,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:43:19,281 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:43:19,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:43:19,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:43:19,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:43:19,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:43:19,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:43:19,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:43:19,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:43:19,283 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:43:19,283 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:43:19,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:43:19,283 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 -> a7ef5e9072271cbf0486c6be0aa2bd26b235c6b4341d8940adfe18a5a48a6524 [2022-07-12 03:43:19,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:43:19,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:43:19,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:43:19,476 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:43:19,486 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:43:19,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-1.c [2022-07-12 03:43:19,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67738075/c2b3dae189eb487c9c3bf3885a6bd904/FLAGaf9350641 [2022-07-12 03:43:19,901 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:43:19,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2022-07-12 03:43:19,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67738075/c2b3dae189eb487c9c3bf3885a6bd904/FLAGaf9350641 [2022-07-12 03:43:19,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67738075/c2b3dae189eb487c9c3bf3885a6bd904 [2022-07-12 03:43:19,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:43:19,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:43:19,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:43:19,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:43:19,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:43:19,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:43:19" (1/1) ... [2022-07-12 03:43:19,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4893359c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:19, skipping insertion in model container [2022-07-12 03:43:19,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:43:19" (1/1) ... [2022-07-12 03:43:19,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:43:19,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:43:20,065 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/loops/eureka_01-1.c[446,459] [2022-07-12 03:43:20,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:43:20,089 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:43:20,097 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/loops/eureka_01-1.c[446,459] [2022-07-12 03:43:20,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:43:20,125 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:43:20,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20 WrapperNode [2022-07-12 03:43:20,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:43:20,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:43:20,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:43:20,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:43:20,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,145 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,167 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2022-07-12 03:43:20,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:43:20,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:43:20,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:43:20,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:43:20,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:43:20,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:43:20,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:43:20,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:43:20,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (1/1) ... [2022-07-12 03:43:20,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:43:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:20,225 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-12 03:43:20,246 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-12 03:43:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:43:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:43:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:43:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:43:20,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:43:20,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:43:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:43:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:43:20,304 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:43:20,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:43:20,466 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:43:20,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:43:20,470 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 03:43:20,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:43:20 BoogieIcfgContainer [2022-07-12 03:43:20,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:43:20,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:43:20,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:43:20,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:43:20,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:43:19" (1/3) ... [2022-07-12 03:43:20,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139491b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:43:20, skipping insertion in model container [2022-07-12 03:43:20,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:43:20" (2/3) ... [2022-07-12 03:43:20,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@139491b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:43:20, skipping insertion in model container [2022-07-12 03:43:20,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:43:20" (3/3) ... [2022-07-12 03:43:20,486 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2022-07-12 03:43:20,495 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:43:20,495 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:43:20,572 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:43:20,577 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@5d1fead3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b0e2add [2022-07-12 03:43:20,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:43:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:43:20,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:20,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:20,589 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2022-07-12 03:43:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:20,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112062687] [2022-07-12 03:43:20,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:20,895 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-12 03:43:20,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:20,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112062687] [2022-07-12 03:43:20,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112062687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:43:20,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:43:20,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:43:20,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743561847] [2022-07-12 03:43:20,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:43:20,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:43:20,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:43:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:43:20,932 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:21,029 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2022-07-12 03:43:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:43:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 03:43:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:21,044 INFO L225 Difference]: With dead ends: 89 [2022-07-12 03:43:21,044 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 03:43:21,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:43:21,056 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:21,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 03:43:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-07-12 03:43:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-12 03:43:21,086 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-07-12 03:43:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:21,086 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-12 03:43:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-12 03:43:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:43:21,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:21,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:21,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:43:21,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:21,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2022-07-12 03:43:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:21,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874888792] [2022-07-12 03:43:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:21,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874888792] [2022-07-12 03:43:21,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874888792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155375029] [2022-07-12 03:43:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:21,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:21,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:21,295 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-12 03:43:21,299 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-12 03:43:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:21,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 03:43:21,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:21,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-12 03:43:21,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:43:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:21,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:21,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-12 03:43:21,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-12 03:43:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:21,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155375029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:21,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:21,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-12 03:43:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85385025] [2022-07-12 03:43:21,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:21,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:43:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:43:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:43:21,702 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-12 03:43:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:21,873 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-07-12 03:43:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:43:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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 19 [2022-07-12 03:43:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:21,875 INFO L225 Difference]: With dead ends: 84 [2022-07-12 03:43:21,876 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 03:43:21,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-07-12 03:43:21,879 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 75 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:21,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 03:43:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2022-07-12 03:43:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-07-12 03:43:21,885 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2022-07-12 03:43:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:21,885 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2022-07-12 03:43:21,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 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-12 03:43:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-07-12 03:43:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:43:21,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:21,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:21,909 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-12 03:43:22,103 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-12 03:43:22,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2022-07-12 03:43:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:22,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342413558] [2022-07-12 03:43:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:22,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:22,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342413558] [2022-07-12 03:43:22,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342413558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:43:22,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:43:22,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:43:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276235968] [2022-07-12 03:43:22,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:43:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:43:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:43:22,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:43:22,147 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:22,163 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-07-12 03:43:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:43:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 03:43:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:22,164 INFO L225 Difference]: With dead ends: 66 [2022-07-12 03:43:22,164 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 03:43:22,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:43:22,165 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:22,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 39 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:43:22,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 03:43:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-07-12 03:43:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 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-12 03:43:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-07-12 03:43:22,169 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2022-07-12 03:43:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:22,170 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-07-12 03:43:22,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-07-12 03:43:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:43:22,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:22,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:22,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:43:22,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:22,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2022-07-12 03:43:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:22,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336157431] [2022-07-12 03:43:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:22,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336157431] [2022-07-12 03:43:22,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336157431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:22,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894431199] [2022-07-12 03:43:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:22,251 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-12 03:43:22,252 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-12 03:43:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:22,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:43:22,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:22,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:22,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894431199] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:22,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:22,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-12 03:43:22,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934269938] [2022-07-12 03:43:22,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:22,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:43:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:22,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:43:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:43:22,379 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-12 03:43:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:22,466 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-07-12 03:43:22,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:43:22,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-12 03:43:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:22,468 INFO L225 Difference]: With dead ends: 114 [2022-07-12 03:43:22,468 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 03:43:22,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:43:22,469 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:22,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 03:43:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2022-07-12 03:43:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-07-12 03:43:22,475 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2022-07-12 03:43:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:22,475 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-07-12 03:43:22,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 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-12 03:43:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-07-12 03:43:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:43:22,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:22,476 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-12 03:43:22,495 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-12 03:43:22,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-12 03:43:22,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:22,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2022-07-12 03:43:22,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:22,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988107262] [2022-07-12 03:43:22,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:22,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:22,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988107262] [2022-07-12 03:43:22,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988107262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:22,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270643681] [2022-07-12 03:43:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:22,750 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-12 03:43:22,751 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-12 03:43:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:22,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:43:22,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:22,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:22,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270643681] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:22,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:22,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-12 03:43:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989549633] [2022-07-12 03:43:22,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:22,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:43:22,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:43:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:43:22,884 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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-12 03:43:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:23,038 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2022-07-12 03:43:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:43:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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-12 03:43:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:23,039 INFO L225 Difference]: With dead ends: 181 [2022-07-12 03:43:23,039 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 03:43:23,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 03:43:23,040 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 164 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:23,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 155 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:23,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 03:43:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2022-07-12 03:43:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 0 states have call successors, (0), 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-12 03:43:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-07-12 03:43:23,048 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2022-07-12 03:43:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:23,049 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-07-12 03:43:23,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 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-12 03:43:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-07-12 03:43:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:43:23,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:23,049 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] [2022-07-12 03:43:23,101 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-12 03:43:23,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:23,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2022-07-12 03:43:23,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:23,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494685842] [2022-07-12 03:43:23,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:23,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494685842] [2022-07-12 03:43:23,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494685842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183846377] [2022-07-12 03:43:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:23,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:23,371 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-12 03:43:23,372 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-12 03:43:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:23,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:43:23,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:23,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:23,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183846377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:23,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:23,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-12 03:43:23,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050110753] [2022-07-12 03:43:23,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:23,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:43:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:43:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:43:23,503 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:23,611 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2022-07-12 03:43:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:43:23,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-12 03:43:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:23,612 INFO L225 Difference]: With dead ends: 206 [2022-07-12 03:43:23,612 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 03:43:23,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:43:23,613 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:23,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 101 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 03:43:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2022-07-12 03:43:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 0 states have call successors, (0), 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-12 03:43:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2022-07-12 03:43:23,624 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2022-07-12 03:43:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:23,625 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2022-07-12 03:43:23,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2022-07-12 03:43:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:43:23,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:23,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:23,649 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-12 03:43:23,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:23,849 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2022-07-12 03:43:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:23,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096537097] [2022-07-12 03:43:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:24,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096537097] [2022-07-12 03:43:24,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096537097] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:24,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240275013] [2022-07-12 03:43:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:24,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:24,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:24,223 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-12 03:43:24,224 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-12 03:43:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:24,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 03:43:24,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:24,299 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 54 treesize of output 50 [2022-07-12 03:43:24,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:43:24,416 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:43:24,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-12 03:43:24,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 03:43:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:24,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:26,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |v_ULTIMATE.start_main_~x~0#1_11|)) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-12 03:43:26,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)))) is different from false [2022-07-12 03:43:27,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int) (v_ArrVal_208 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_208))) (or (<= 0 (select (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (not (<= 0 v_ArrVal_208)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|))))) is different from false [2022-07-12 03:43:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-12 03:43:27,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240275013] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:27,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:27,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2022-07-12 03:43:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029765149] [2022-07-12 03:43:27,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:27,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 03:43:27,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 03:43:27,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=338, Unknown=3, NotChecked=120, Total=552 [2022-07-12 03:43:27,700 INFO L87 Difference]: Start difference. First operand 92 states and 119 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-12 03:43:28,011 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-12 03:43:28,320 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int) (v_ArrVal_210 Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_11|)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-12 03:43:30,360 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_11| Int)) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |v_ULTIMATE.start_main_~x~0#1_11|)) (forall ((v_ArrVal_210 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_11| 4)) v_ArrVal_210) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= |c_ULTIMATE.start_main_~j~0#1| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) 1)) is different from false [2022-07-12 03:43:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:30,456 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-07-12 03:43:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:43:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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) Word has length 25 [2022-07-12 03:43:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:30,457 INFO L225 Difference]: With dead ends: 112 [2022-07-12 03:43:30,457 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 03:43:30,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=134, Invalid=484, Unknown=6, NotChecked=306, Total=930 [2022-07-12 03:43:30,458 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:30,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 104 Unchecked, 0.0s Time] [2022-07-12 03:43:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 03:43:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-12 03:43:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 0 states have call successors, (0), 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-12 03:43:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2022-07-12 03:43:30,471 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 25 [2022-07-12 03:43:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:30,472 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2022-07-12 03:43:30,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 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-12 03:43:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2022-07-12 03:43:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:43:30,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:30,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:30,512 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-12 03:43:30,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:30,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2022-07-12 03:43:30,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:30,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135164491] [2022-07-12 03:43:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:43:30,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135164491] [2022-07-12 03:43:30,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135164491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660960225] [2022-07-12 03:43:30,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:43:30,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:30,808 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-12 03:43:30,833 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-12 03:43:30,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:43:30,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:30,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 03:43:30,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:30,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 03:43:30,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:43:30,947 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 30 treesize of output 29 [2022-07-12 03:43:30,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:43:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:43:31,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:33,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-12 03:43:33,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-07-12 03:43:33,075 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 68 treesize of output 66 [2022-07-12 03:43:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2022-07-12 03:43:33,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660960225] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:33,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:33,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-07-12 03:43:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155399612] [2022-07-12 03:43:33,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:33,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:43:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:43:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2022-07-12 03:43:33,109 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,128 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_66| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_66|)) (forall ((v_ArrVal_250 Int)) (<= 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_250) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= .cse0 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) .cse0) 0))) is different from false [2022-07-12 03:43:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:35,312 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-07-12 03:43:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:43:35,312 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 03:43:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:35,314 INFO L225 Difference]: With dead ends: 145 [2022-07-12 03:43:35,314 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 03:43:35,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=113, Invalid=313, Unknown=2, NotChecked=78, Total=506 [2022-07-12 03:43:35,315 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:35,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 153 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 200 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-07-12 03:43:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 03:43:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2022-07-12 03:43:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 0 states have call successors, (0), 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-12 03:43:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-07-12 03:43:35,323 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 25 [2022-07-12 03:43:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:35,324 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-07-12 03:43:35,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-07-12 03:43:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:43:35,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:35,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:35,342 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-12 03:43:35,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:35,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2022-07-12 03:43:35,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:35,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144247369] [2022-07-12 03:43:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:35,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144247369] [2022-07-12 03:43:35,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144247369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:35,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449298906] [2022-07-12 03:43:35,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:43:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:35,612 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-12 03:43:35,613 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-12 03:43:35,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:43:35,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:35,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:43:35,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:35,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:43:35,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449298906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:35,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:35,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-12 03:43:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661812344] [2022-07-12 03:43:35,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:35,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:43:35,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:35,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:43:35,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:43:35,753 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:35,905 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2022-07-12 03:43:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:43:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 03:43:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:35,907 INFO L225 Difference]: With dead ends: 183 [2022-07-12 03:43:35,907 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 03:43:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-07-12 03:43:35,908 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 104 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:35,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 178 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:43:35,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 03:43:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2022-07-12 03:43:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 0 states have call successors, (0), 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-12 03:43:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-07-12 03:43:35,917 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2022-07-12 03:43:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:35,918 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-07-12 03:43:35,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-07-12 03:43:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:43:35,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:35,919 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] [2022-07-12 03:43:35,960 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-12 03:43:36,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:36,136 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 160714710, now seen corresponding path program 2 times [2022-07-12 03:43:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:36,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044638973] [2022-07-12 03:43:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:43:36,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044638973] [2022-07-12 03:43:36,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044638973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:36,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002000512] [2022-07-12 03:43:36,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:43:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:36,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:36,177 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-12 03:43:36,178 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-12 03:43:36,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:43:36,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:36,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:43:36,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 03:43:36,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:43:36,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002000512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:43:36,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 03:43:36,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-12 03:43:36,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610463137] [2022-07-12 03:43:36,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:43:36,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:43:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:36,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:43:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:43:36,304 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:36,347 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-07-12 03:43:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:43:36,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 03:43:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:36,348 INFO L225 Difference]: With dead ends: 213 [2022-07-12 03:43:36,348 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 03:43:36,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:43:36,365 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:36,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:43:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 03:43:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2022-07-12 03:43:36,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 0 states have call successors, (0), 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-12 03:43:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2022-07-12 03:43:36,376 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 29 [2022-07-12 03:43:36,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:36,376 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2022-07-12 03:43:36,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-07-12 03:43:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:43:36,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:36,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:36,423 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-12 03:43:36,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 03:43:36,578 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2022-07-12 03:43:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:36,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454201072] [2022-07-12 03:43:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:43:36,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:36,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454201072] [2022-07-12 03:43:36,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454201072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:36,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152588983] [2022-07-12 03:43:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:36,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:36,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:36,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:43:36,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:43:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:36,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 03:43:36,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:36,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:43:36,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 03:43:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:43:36,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:43:37,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-07-12 03:43:37,022 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 32 treesize of output 28 [2022-07-12 03:43:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:43:37,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152588983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:43:37,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:43:37,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-07-12 03:43:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234271427] [2022-07-12 03:43:37,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:43:37,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 03:43:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:43:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 03:43:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-12 03:43:37,073 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:43:37,435 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2022-07-12 03:43:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 03:43:37,436 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 03:43:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:43:37,436 INFO L225 Difference]: With dead ends: 194 [2022-07-12 03:43:37,437 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 03:43:37,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:43:37,437 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 184 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:43:37,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 286 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 393 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2022-07-12 03:43:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 03:43:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 120. [2022-07-12 03:43:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.26890756302521) internal successors, (151), 119 states have internal predecessors, (151), 0 states have call successors, (0), 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-12 03:43:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2022-07-12 03:43:37,447 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 29 [2022-07-12 03:43:37,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:43:37,447 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2022-07-12 03:43:37,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:43:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2022-07-12 03:43:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:43:37,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:43:37,447 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:43:37,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:43:37,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:37,648 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:43:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:43:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2022-07-12 03:43:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:43:37,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981919934] [2022-07-12 03:43:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:43:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:43:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:43:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:43:38,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981919934] [2022-07-12 03:43:38,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981919934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:43:38,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292859816] [2022-07-12 03:43:38,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:43:38,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:43:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:43:38,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:43:38,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:43:38,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:43:38,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:43:38,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 03:43:38,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:43:38,318 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 66 treesize of output 64 [2022-07-12 03:43:38,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:43:38,406 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-12 03:43:38,406 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 35 treesize of output 44 [2022-07-12 03:43:38,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:43:38,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:43:38,536 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:43:38,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-12 03:43:38,655 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-12 03:43:38,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 58 [2022-07-12 03:43:40,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-12 03:43:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:43:40,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:44:10,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292859816] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:10,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:10,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 46 [2022-07-12 03:44:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751570134] [2022-07-12 03:44:10,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:10,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 03:44:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 03:44:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1693, Unknown=16, NotChecked=0, Total=2070 [2022-07-12 03:44:10,312 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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-12 03:44:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:11,538 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2022-07-12 03:44:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 03:44:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 03:44:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:11,539 INFO L225 Difference]: With dead ends: 155 [2022-07-12 03:44:11,539 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 03:44:11,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=683, Invalid=3083, Unknown=16, NotChecked=0, Total=3782 [2022-07-12 03:44:11,540 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 73 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:11,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 288 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 202 Unchecked, 0.1s Time] [2022-07-12 03:44:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 03:44:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2022-07-12 03:44:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 0 states have call successors, (0), 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-12 03:44:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 159 transitions. [2022-07-12 03:44:11,550 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 159 transitions. Word has length 31 [2022-07-12 03:44:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:11,551 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 159 transitions. [2022-07-12 03:44:11,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.826086956521739) internal successors, (84), 46 states have internal predecessors, (84), 0 states have call successors, (0), 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-12 03:44:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 159 transitions. [2022-07-12 03:44:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:44:11,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:11,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:11,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:44:11,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 03:44:11,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2022-07-12 03:44:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:11,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420878265] [2022-07-12 03:44:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:11,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 03:44:11,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420878265] [2022-07-12 03:44:11,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420878265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:44:11,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:44:11,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:44:11,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082886869] [2022-07-12 03:44:11,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:44:11,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:44:11,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:44:11,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:44:11,821 INFO L87 Difference]: Start difference. First operand 126 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:11,845 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2022-07-12 03:44:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:44:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-12 03:44:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:11,847 INFO L225 Difference]: With dead ends: 202 [2022-07-12 03:44:11,847 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 03:44:11,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:44:11,848 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:11,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 73 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:44:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 03:44:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-07-12 03:44:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.264) internal successors, (158), 125 states have internal predecessors, (158), 0 states have call successors, (0), 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-12 03:44:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 158 transitions. [2022-07-12 03:44:11,877 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 158 transitions. Word has length 31 [2022-07-12 03:44:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:11,877 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 158 transitions. [2022-07-12 03:44:11,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 158 transitions. [2022-07-12 03:44:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:44:11,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:11,878 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:11,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:44:11,878 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 2 times [2022-07-12 03:44:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:11,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331953152] [2022-07-12 03:44:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:44:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:11,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331953152] [2022-07-12 03:44:11,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331953152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:11,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422928762] [2022-07-12 03:44:11,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:44:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:11,942 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:44:11,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 03:44:12,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:44:12,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:12,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:44:12,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:44:12,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:44:12,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422928762] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:12,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:12,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-12 03:44:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715368550] [2022-07-12 03:44:12,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:12,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:44:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:44:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:44:12,125 INFO L87 Difference]: Start difference. First operand 126 states and 158 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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-12 03:44:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:12,303 INFO L93 Difference]: Finished difference Result 408 states and 511 transitions. [2022-07-12 03:44:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:44:12,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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 33 [2022-07-12 03:44:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:12,305 INFO L225 Difference]: With dead ends: 408 [2022-07-12 03:44:12,305 INFO L226 Difference]: Without dead ends: 303 [2022-07-12 03:44:12,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-07-12 03:44:12,306 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 220 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:12,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 143 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:44:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-12 03:44:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 209. [2022-07-12 03:44:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 208 states have internal predecessors, (267), 0 states have call successors, (0), 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-12 03:44:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 267 transitions. [2022-07-12 03:44:12,324 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 267 transitions. Word has length 33 [2022-07-12 03:44:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:12,324 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 267 transitions. [2022-07-12 03:44:12,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 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-12 03:44:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 267 transitions. [2022-07-12 03:44:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:44:12,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:12,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:12,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 03:44:12,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 03:44:12,563 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:12,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2022-07-12 03:44:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:12,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513965095] [2022-07-12 03:44:12,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:44:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:12,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513965095] [2022-07-12 03:44:12,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513965095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:12,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681491794] [2022-07-12 03:44:12,665 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:44:12,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:12,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:12,666 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:44:12,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 03:44:12,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:44:12,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:12,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:44:12,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:44:12,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:44:12,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681491794] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:12,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:12,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-12 03:44:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723382831] [2022-07-12 03:44:12,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:12,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:44:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:44:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:44:12,822 INFO L87 Difference]: Start difference. First operand 209 states and 267 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 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-12 03:44:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:13,059 INFO L93 Difference]: Finished difference Result 492 states and 617 transitions. [2022-07-12 03:44:13,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:44:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 03:44:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:13,061 INFO L225 Difference]: With dead ends: 492 [2022-07-12 03:44:13,062 INFO L226 Difference]: Without dead ends: 470 [2022-07-12 03:44:13,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2022-07-12 03:44:13,063 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 116 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:13,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 308 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:44:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-07-12 03:44:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 294. [2022-07-12 03:44:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.3139931740614335) internal successors, (385), 293 states have internal predecessors, (385), 0 states have call successors, (0), 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-12 03:44:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 385 transitions. [2022-07-12 03:44:13,108 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 385 transitions. Word has length 34 [2022-07-12 03:44:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:13,108 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 385 transitions. [2022-07-12 03:44:13,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 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-12 03:44:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 385 transitions. [2022-07-12 03:44:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:44:13,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:13,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:44:13,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:44:13,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 03:44:13,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:13,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:13,324 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2022-07-12 03:44:13,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:13,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763415477] [2022-07-12 03:44:13,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:13,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:13,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:44:13,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:13,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763415477] [2022-07-12 03:44:13,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763415477] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:13,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87684324] [2022-07-12 03:44:13,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:44:13,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:13,794 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:44:13,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 03:44:13,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:44:13,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:13,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 03:44:13,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:13,898 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 51 treesize of output 49 [2022-07-12 03:44:13,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 03:44:13,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:13,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-12 03:44:14,090 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:44:14,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 03:44:14,162 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:44:14,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-12 03:44:14,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 03:44:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:44:14,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:44:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:44:23,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87684324] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:44:23,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:44:23,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 34 [2022-07-12 03:44:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252875694] [2022-07-12 03:44:23,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:44:23,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 03:44:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:44:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 03:44:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=915, Unknown=9, NotChecked=0, Total=1122 [2022-07-12 03:44:23,472 INFO L87 Difference]: Start difference. First operand 294 states and 385 transitions. Second operand has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:44:23,802 INFO L93 Difference]: Finished difference Result 380 states and 485 transitions. [2022-07-12 03:44:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:44:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 03:44:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:44:23,804 INFO L225 Difference]: With dead ends: 380 [2022-07-12 03:44:23,804 INFO L226 Difference]: Without dead ends: 362 [2022-07-12 03:44:23,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=315, Invalid=1236, Unknown=9, NotChecked=0, Total=1560 [2022-07-12 03:44:23,805 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 205 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:44:23,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 330 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 165 Invalid, 0 Unknown, 234 Unchecked, 0.1s Time] [2022-07-12 03:44:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-12 03:44:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 334. [2022-07-12 03:44:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3093093093093093) internal successors, (436), 333 states have internal predecessors, (436), 0 states have call successors, (0), 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-12 03:44:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 436 transitions. [2022-07-12 03:44:23,840 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 436 transitions. Word has length 34 [2022-07-12 03:44:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:44:23,840 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 436 transitions. [2022-07-12 03:44:23,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:44:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 436 transitions. [2022-07-12 03:44:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:44:23,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:44:23,841 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, 1, 1, 1, 1, 1] [2022-07-12 03:44:23,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 03:44:24,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 03:44:24,059 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:44:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:44:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2022-07-12 03:44:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:44:24,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998577193] [2022-07-12 03:44:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:44:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:44:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:44:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:44:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:44:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998577193] [2022-07-12 03:44:24,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998577193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:44:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489743385] [2022-07-12 03:44:24,577 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:44:24,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:44:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:44:24,579 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:44:24,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 03:44:24,781 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-12 03:44:24,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:44:24,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 03:44:24,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:44:24,799 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 18 treesize of output 16 [2022-07-12 03:44:24,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:24,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:24,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:24,858 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:44:24,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2022-07-12 03:44:25,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:44:25,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,061 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:44:25,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 73 [2022-07-12 03:44:25,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:44:25,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,213 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 03:44:25,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 71 [2022-07-12 03:44:25,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:44:25,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:44:25,376 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:44:25,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 71 [2022-07-12 03:44:25,896 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:44:25,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2022-07-12 03:44:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:44:25,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:45:18,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_38|)) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_625))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_627)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-12 03:45:20,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_620 Int) (|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse1 (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_620))) (store .cse2 (+ (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622)))) (or (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_625))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4)) v_ArrVal_627)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_38|)) (not (<= 0 v_ArrVal_620))))) is different from false [2022-07-12 03:45:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:45:20,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489743385] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:45:20,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:45:20,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 21] total 52 [2022-07-12 03:45:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678123047] [2022-07-12 03:45:20,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:45:20,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 03:45:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:45:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 03:45:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1973, Unknown=26, NotChecked=194, Total=2652 [2022-07-12 03:45:20,298 INFO L87 Difference]: Start difference. First operand 334 states and 436 transitions. Second operand has 52 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 52 states have internal predecessors, (99), 0 states have call successors, (0), 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-12 03:45:21,736 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= .cse1 3) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (<= 3 .cse1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 4 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= 0 (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (= (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_38|)) (<= 0 (select (let ((.cse4 (store .cse3 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_625))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_627)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0)))) is different from false [2022-07-12 03:45:22,266 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Source~0#1.base|)) (= .cse1 3) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (<= 3 .cse1) (= (select .cse2 0) 0) (= 4 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 0) (<= 0 (select .cse2 |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1_38| Int) (v_ArrVal_627 Int) (v_ArrVal_625 Int) (v_ArrVal_622 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_622))) (or (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse3) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) |v_ULTIMATE.start_main_~x~0#1_38|)) (<= 0 (select (let ((.cse4 (store .cse3 (+ (* |v_ULTIMATE.start_main_~x~0#1_38| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_625))) (store .cse4 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse4) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8)) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_627)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0)))) is different from false [2022-07-12 03:45:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:45:23,513 INFO L93 Difference]: Finished difference Result 385 states and 495 transitions. [2022-07-12 03:45:23,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 03:45:23,514 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 52 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 03:45:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:45:23,515 INFO L225 Difference]: With dead ends: 385 [2022-07-12 03:45:23,515 INFO L226 Difference]: Without dead ends: 351 [2022-07-12 03:45:23,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=922, Invalid=3758, Unknown=28, NotChecked=548, Total=5256 [2022-07-12 03:45:23,517 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 110 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 392 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:45:23,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 416 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 457 Invalid, 0 Unknown, 392 Unchecked, 0.3s Time] [2022-07-12 03:45:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-12 03:45:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 335. [2022-07-12 03:45:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.311377245508982) internal successors, (438), 334 states have internal predecessors, (438), 0 states have call successors, (0), 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-12 03:45:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 438 transitions. [2022-07-12 03:45:23,597 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 438 transitions. Word has length 37 [2022-07-12 03:45:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:45:23,598 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 438 transitions. [2022-07-12 03:45:23,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 52 states have internal predecessors, (99), 0 states have call successors, (0), 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-12 03:45:23,598 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 438 transitions. [2022-07-12 03:45:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:45:23,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:45:23,603 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:45:23,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 03:45:23,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:45:23,817 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:45:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:45:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1312147662, now seen corresponding path program 3 times [2022-07-12 03:45:23,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:45:23,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122559483] [2022-07-12 03:45:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:45:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:45:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:45:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:45:23,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:45:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122559483] [2022-07-12 03:45:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122559483] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:45:23,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206180770] [2022-07-12 03:45:23,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:45:23,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:45:23,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:45:23,912 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:45:23,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 03:45:24,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 03:45:24,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:45:24,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 03:45:24,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:45:24,023 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 18 treesize of output 16 [2022-07-12 03:45:24,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 03:45:24,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:45:24,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 03:45:24,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:45:24,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 03:45:24,266 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:45:24,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-07-12 03:45:24,337 INFO L356 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2022-07-12 03:45:24,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 48 [2022-07-12 03:45:26,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 03:45:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:45:26,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:45:31,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_43| Int)) (or (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_688 Int)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4)) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|))) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |v_ULTIMATE.start_main_~x~0#1_43|)))) is different from false [2022-07-12 03:45:32,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4)) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|)))) is different from false [2022-07-12 03:45:34,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|))))) is different from false [2022-07-12 03:45:36,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|))))))) is different from false [2022-07-12 03:46:10,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4)) v_ArrVal_683) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_148|)))) is different from false [2022-07-12 03:46:12,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (|v_ULTIMATE.start_main_~i~0#1_148| Int) (v_ArrVal_684 Int) (v_ArrVal_683 Int) (v_ArrVal_681 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_681) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4)) v_ArrVal_683) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (not (<= 0 v_ArrVal_681)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|)) (<= 0 (select (let ((.cse1 (store .cse0 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse1 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_148|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|))))) is different from false [2022-07-12 03:46:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 17 not checked. [2022-07-12 03:46:12,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206180770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:46:12,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:46:12,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 21] total 44 [2022-07-12 03:46:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9017419] [2022-07-12 03:46:12,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:46:12,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 03:46:12,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:46:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 03:46:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1147, Unknown=24, NotChecked=462, Total=1892 [2022-07-12 03:46:12,607 INFO L87 Difference]: Start difference. First operand 335 states and 438 transitions. Second operand has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 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-12 03:46:18,590 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |c_ULTIMATE.start_main_~nodecount~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_148| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (v_ArrVal_683 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_148| 4)) v_ArrVal_683) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4)))) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_148| 1) |v_ULTIMATE.start_main_~i~0#1_147|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_148|))))) is different from false [2022-07-12 03:46:20,641 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |c_ULTIMATE.start_main_~nodecount~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|))))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) is different from false [2022-07-12 03:46:21,361 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|))))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) is different from false [2022-07-12 03:46:22,073 WARN L833 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~nodecount~0#1|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_684 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_684))) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store .cse1 (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))))) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse1) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|))))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) is different from false [2022-07-12 03:46:22,771 WARN L833 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~nodecount~0#1|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4)) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|)))) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) is different from false [2022-07-12 03:46:23,520 WARN L833 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~nodecount~0#1|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (|v_ULTIMATE.start_main_~x~0#1_43| Int) (v_ArrVal_688 Int)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4)) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1_43|)))) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) is different from false [2022-07-12 03:46:25,528 WARN L833 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~nodecount~0#1|) (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Dest~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1_43| Int)) (or (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_686 Int) (v_ArrVal_688 Int)) (or (<= (+ |ULTIMATE.start_main_~j~0#1| 1) 0) (<= 0 (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~x~0#1_43| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_686))) (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0) |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) 4)) v_ArrVal_688)) |c_ULTIMATE.start_main_~#distance~0#1.offset|)) (<= 1 |ULTIMATE.start_main_~j~0#1|))) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|) (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) |v_ULTIMATE.start_main_~x~0#1_43|)))) (= |c_ULTIMATE.start_main_~j~0#1| 0) (<= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) |c_ULTIMATE.start_main_~#distance~0#1.offset|))) is different from false [2022-07-12 03:46:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:46:43,519 INFO L93 Difference]: Finished difference Result 766 states and 998 transitions. [2022-07-12 03:46:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-07-12 03:46:43,520 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 03:46:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:46:43,522 INFO L225 Difference]: With dead ends: 766 [2022-07-12 03:46:43,522 INFO L226 Difference]: Without dead ends: 744 [2022-07-12 03:46:43,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 107 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3057 ImplicationChecksByTransitivity, 78.4s TimeCoverageRelationStatistics Valid=1443, Invalid=7691, Unknown=38, NotChecked=2600, Total=11772 [2022-07-12 03:46:43,525 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 219 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:46:43,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 400 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 517 Invalid, 0 Unknown, 790 Unchecked, 0.2s Time] [2022-07-12 03:46:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-07-12 03:46:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 426. [2022-07-12 03:46:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 1.3294117647058823) internal successors, (565), 425 states have internal predecessors, (565), 0 states have call successors, (0), 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-12 03:46:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 565 transitions. [2022-07-12 03:46:43,571 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 565 transitions. Word has length 37 [2022-07-12 03:46:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:46:43,572 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 565 transitions. [2022-07-12 03:46:43,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.3181818181818183) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 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-12 03:46:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 565 transitions. [2022-07-12 03:46:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:46:43,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:46:43,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:46:43,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-12 03:46:43,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 03:46:43,796 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:46:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:46:43,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2022-07-12 03:46:43,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:46:43,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064141105] [2022-07-12 03:46:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:46:43,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:46:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:46:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:46:44,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:46:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064141105] [2022-07-12 03:46:44,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064141105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:46:44,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39432235] [2022-07-12 03:46:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:46:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:46:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:46:44,849 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:46:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 03:46:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:46:44,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 03:46:44,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:46:44,941 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 18 treesize of output 16 [2022-07-12 03:46:44,999 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:46:45,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2022-07-12 03:46:45,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:46:45,113 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:46:45,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2022-07-12 03:46:45,244 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 03:46:45,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 55 [2022-07-12 03:46:45,411 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 03:46:45,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 71 [2022-07-12 03:46:45,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:46:45,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:46:45,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:46:45,447 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 44 treesize of output 18 [2022-07-12 03:46:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 03:46:45,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:47:21,951 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_739 Int)) (or (let ((.cse0 (let ((.cse2 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_739) (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_159| 4)) v_ArrVal_740))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse2) |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4)) v_ArrVal_742)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base| .cse0))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 4))) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|) 4))) (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|))))) (not (<= (+ v_ArrVal_742 1) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_159|)) (not (<= 0 v_ArrVal_739)))) is different from false [2022-07-12 03:47:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-07-12 03:47:21,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39432235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:47:21,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:47:21,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-12 03:47:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656336849] [2022-07-12 03:47:21,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:47:21,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 03:47:21,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:47:21,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 03:47:21,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=621, Unknown=12, NotChecked=52, Total=812 [2022-07-12 03:47:21,983 INFO L87 Difference]: Start difference. First operand 426 states and 565 transitions. Second operand has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 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-12 03:47:40,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:47:40,197 INFO L93 Difference]: Finished difference Result 726 states and 924 transitions. [2022-07-12 03:47:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 03:47:40,198 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 03:47:40,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:47:40,200 INFO L225 Difference]: With dead ends: 726 [2022-07-12 03:47:40,200 INFO L226 Difference]: Without dead ends: 601 [2022-07-12 03:47:40,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=478, Invalid=1956, Unknown=20, NotChecked=96, Total=2550 [2022-07-12 03:47:40,202 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 367 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:47:40,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 407 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 341 Invalid, 0 Unknown, 346 Unchecked, 0.3s Time] [2022-07-12 03:47:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-07-12 03:47:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 439. [2022-07-12 03:47:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.317351598173516) internal successors, (577), 438 states have internal predecessors, (577), 0 states have call successors, (0), 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-12 03:47:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 577 transitions. [2022-07-12 03:47:40,257 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 577 transitions. Word has length 38 [2022-07-12 03:47:40,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:47:40,257 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 577 transitions. [2022-07-12 03:47:40,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 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-12 03:47:40,257 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 577 transitions. [2022-07-12 03:47:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:47:40,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:47:40,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:47:40,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 03:47:40,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:47:40,468 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:47:40,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:47:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2022-07-12 03:47:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:47:40,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039060746] [2022-07-12 03:47:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:47:40,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:47:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:47:40,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:47:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:47:40,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:47:40,610 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:47:40,610 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:47:40,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 03:47:40,619 INFO L356 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:47:40,624 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:47:40,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:47:40 BoogieIcfgContainer [2022-07-12 03:47:40,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:47:40,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:47:40,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:47:40,702 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:47:40,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:43:20" (3/4) ... [2022-07-12 03:47:40,704 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 03:47:40,756 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:47:40,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:47:40,757 INFO L158 Benchmark]: Toolchain (without parser) took 260838.42ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 80.9MB in the beginning and 89.8MB in the end (delta: -8.9MB). Peak memory consumption was 43.5MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,757 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 111.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:47:40,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.86ms. Allocated memory is still 111.1MB. Free memory was 80.6MB in the beginning and 83.6MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.61ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 81.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,760 INFO L158 Benchmark]: Boogie Preprocessor took 20.45ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 79.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,761 INFO L158 Benchmark]: RCFGBuilder took 286.96ms. Allocated memory is still 111.1MB. Free memory was 79.4MB in the beginning and 64.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,761 INFO L158 Benchmark]: TraceAbstraction took 260224.42ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 64.1MB in the beginning and 94.0MB in the end (delta: -29.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,761 INFO L158 Benchmark]: Witness Printer took 54.39ms. Allocated memory is still 163.6MB. Free memory was 94.0MB in the beginning and 89.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:47:40,765 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.16ms. Allocated memory is still 111.1MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.86ms. Allocated memory is still 111.1MB. Free memory was 80.6MB in the beginning and 83.6MB in the end (delta: -3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.61ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 81.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.45ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 79.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.96ms. Allocated memory is still 111.1MB. Free memory was 79.4MB in the beginning and 64.6MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 260224.42ms. Allocated memory was 111.1MB in the beginning and 163.6MB in the end (delta: 52.4MB). Free memory was 64.1MB in the beginning and 94.0MB in the end (delta: -29.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 54.39ms. Allocated memory is still 163.6MB. Free memory was 94.0MB in the beginning and 89.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int INFINITY = 899; VAL [INFINITY=899] [L18] int nodecount = __VERIFIER_nondet_int(); [L19] int edgecount = __VERIFIER_nondet_int(); [L20] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L21] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L22] int source = 0; [L23] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L24] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L25] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L26] int distance[5]; [L27] int x,y; [L28] int i,j; [L30] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L31] COND TRUE i == source [L32] distance[i] = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] COND TRUE i < nodecount VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L31] COND FALSE !(i == source) [L35] distance[i] = INFINITY VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L30] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L30] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L39] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={21:0}, Weight={25:0}] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={21:0}, source=0, Weight={25:0}] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={22:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={21:0}, source=0, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND TRUE distance[x] > distance[y] + Weight[j] [L47] distance[x] = -1 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] j++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] COND TRUE i < nodecount [L41] j = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND TRUE j < edgecount [L43] EXPR Dest[j] [L43] x = Dest[j] [L44] EXPR Source[j] [L44] y = Source[j] [L45] EXPR distance[x] [L45] EXPR distance[y] [L45] EXPR Weight[j] VAL [Dest={23:0}, distance={22:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, source=0, Source={21:0}, Weight={25:0}, Weight[j]=0, x=1, y=0] [L45] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L41] j++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L41] COND FALSE !(j < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L39] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L39] COND FALSE !(i < nodecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L51] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L51] COND TRUE i < edgecount [L53] EXPR Dest[i] [L53] x = Dest[i] [L54] EXPR Source[i] [L54] y = Source[i] [L55] EXPR distance[x] [L55] EXPR distance[y] [L55] EXPR Weight[i] VAL [Dest={23:0}, distance={22:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, Weight[i]=0, x=1, y=0] [L55] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L51] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L51] COND FALSE !(i < edgecount) VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={21:0}, Weight={25:0}, x=1, y=0] [L61] i = 0 VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] [L63] CALL __VERIFIER_assert(distance[i]>=0) [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L63] RET __VERIFIER_assert(distance[i]>=0) [L61] i++ VAL [Dest={23:0}, distance={22:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={21:0}, source=0, Weight={25:0}, x=1, y=0] [L61] COND TRUE i < nodecount [L63] EXPR distance[i] [L63] CALL __VERIFIER_assert(distance[i]>=0) [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L12] reach_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 260.1s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 60.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2226 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2226 mSDsluCounter, 3879 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2282 IncrementalHoareTripleChecker+Unchecked, 3285 mSDsCounter, 748 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3603 IncrementalHoareTripleChecker+Invalid, 6633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 748 mSolverCounterUnsat, 594 mSDtfsCounter, 3603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1298 GetRequests, 732 SyntacticMatches, 41 SemanticMatches, 525 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 7559 ImplicationChecksByTransitivity, 244.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=439occurred in iteration=19, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1250 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 193.0s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1382 ConstructedInterpolants, 154 QuantifiedInterpolants, 20956 SizeOfPredicates, 168 NumberOfNonLiveVariables, 4410 ConjunctsInSsa, 368 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 226/600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 03:47:40,961 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE