./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 eb692b52 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-?-eb692b5 [2022-07-19 14:50:35,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:50:35,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:50:35,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:50:35,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:50:35,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:50:35,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:50:35,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:50:35,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:50:35,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:50:35,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:50:35,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:50:35,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:50:35,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:50:35,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:50:35,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:50:35,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:50:35,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:50:35,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:50:35,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:50:35,454 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:50:35,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:50:35,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:50:35,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:50:35,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:50:35,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:50:35,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:50:35,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:50:35,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:50:35,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:50:35,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:50:35,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:50:35,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:50:35,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:50:35,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:50:35,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:50:35,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:50:35,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:50:35,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:50:35,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:50:35,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:50:35,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:50:35,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:50:35,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:50:35,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:50:35,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:50:35,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:50:35,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:50:35,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:50:35,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:50:35,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:50:35,497 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:50:35,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:50:35,498 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:50:35,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:50:35,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:50:35,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:50:35,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:50:35,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:50:35,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:50:35,499 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:50:35,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:50:35,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:50:35,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:50:35,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:50:35,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:50:35,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:50:35,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:50:35,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:50:35,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:50:35,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:50:35,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:50:35,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:50:35,502 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:50:35,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:50:35,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:50:35,502 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-19 14:50:35,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:50:35,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:50:35,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:50:35,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:50:35,712 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:50:35,713 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-19 14:50:35,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3e0ab3c/0705a8ff489547bfa4736d97ff0fc915/FLAG6cf135ddb [2022-07-19 14:50:36,099 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:50:36,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-1.c [2022-07-19 14:50:36,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3e0ab3c/0705a8ff489547bfa4736d97ff0fc915/FLAG6cf135ddb [2022-07-19 14:50:36,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d3e0ab3c/0705a8ff489547bfa4736d97ff0fc915 [2022-07-19 14:50:36,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:50:36,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:50:36,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:50:36,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:50:36,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:50:36,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd19281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36, skipping insertion in model container [2022-07-19 14:50:36,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:50:36,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:50:36,254 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-19 14:50:36,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:50:36,294 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:50:36,310 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-19 14:50:36,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:50:36,337 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:50:36,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36 WrapperNode [2022-07-19 14:50:36,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:50:36,339 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:50:36,339 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:50:36,339 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:50:36,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,377 INFO L137 Inliner]: procedures = 15, calls = 98, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2022-07-19 14:50:36,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:50:36,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:50:36,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:50:36,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:50:36,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:50:36,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:50:36,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:50:36,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:50:36,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (1/1) ... [2022-07-19 14:50:36,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:50:36,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:36,442 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-19 14:50:36,444 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-19 14:50:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:50:36,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:50:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:50:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:50:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:50:36,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:50:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:50:36,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:50:36,539 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:50:36,540 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:50:36,716 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:50:36,721 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:50:36,721 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 14:50:36,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:50:36 BoogieIcfgContainer [2022-07-19 14:50:36,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:50:36,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:50:36,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:50:36,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:50:36,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:50:36" (1/3) ... [2022-07-19 14:50:36,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9e333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:50:36, skipping insertion in model container [2022-07-19 14:50:36,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:50:36" (2/3) ... [2022-07-19 14:50:36,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab9e333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:50:36, skipping insertion in model container [2022-07-19 14:50:36,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:50:36" (3/3) ... [2022-07-19 14:50:36,730 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_01-1.c [2022-07-19 14:50:36,739 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:50:36,740 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:50:36,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:50:36,786 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@4e37b37b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@418a0370 [2022-07-19 14:50:36,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:50:36,789 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-19 14:50:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 14:50:36,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:36,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:50:36,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1963003136, now seen corresponding path program 1 times [2022-07-19 14:50:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:36,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124831841] [2022-07-19 14:50:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:37,053 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-19 14:50:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:37,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124831841] [2022-07-19 14:50:37,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124831841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:50:37,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:50:37,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:50:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351872044] [2022-07-19 14:50:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:50:37,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:50:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:37,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:50:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:50:37,090 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-19 14:50:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:37,178 INFO L93 Difference]: Finished difference Result 89 states and 135 transitions. [2022-07-19 14:50:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:50:37,180 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-19 14:50:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:37,203 INFO L225 Difference]: With dead ends: 89 [2022-07-19 14:50:37,203 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 14:50:37,205 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-19 14:50:37,207 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-19 14:50:37,208 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-19 14:50:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 14:50:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2022-07-19 14:50:37,227 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-19 14:50:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-07-19 14:50:37,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-07-19 14:50:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:37,228 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-07-19 14:50:37,229 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-19 14:50:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-07-19 14:50:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:50:37,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:37,230 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-19 14:50:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:50:37,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash 629591390, now seen corresponding path program 1 times [2022-07-19 14:50:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:37,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869289117] [2022-07-19 14:50:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:37,383 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-19 14:50:37,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:37,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869289117] [2022-07-19 14:50:37,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869289117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:37,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052196870] [2022-07-19 14:50:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:37,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:37,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:37,386 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-19 14:50:37,396 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-19 14:50:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:37,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 14:50:37,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:37,561 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-19 14:50:37,665 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-19 14:50:37,695 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-19 14:50:37,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:37,752 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-19 14:50:37,755 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-19 14:50:37,767 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-19 14:50:37,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052196870] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:37,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:37,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-19 14:50:37,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651462393] [2022-07-19 14:50:37,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:37,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:50:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:50:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:50:37,772 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-19 14:50:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:37,931 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2022-07-19 14:50:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:50:37,932 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-19 14:50:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:37,933 INFO L225 Difference]: With dead ends: 84 [2022-07-19 14:50:37,933 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 14:50:37,933 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-19 14:50:37,934 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-19 14:50:37,935 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-19 14:50:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 14:50:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 43. [2022-07-19 14:50:37,939 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-19 14:50:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2022-07-19 14:50:37,940 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 19 [2022-07-19 14:50:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:37,941 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2022-07-19 14:50:37,941 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-19 14:50:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2022-07-19 14:50:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:50:37,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:37,942 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-19 14:50:37,971 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-19 14:50:38,172 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-19 14:50:38,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash -381525860, now seen corresponding path program 1 times [2022-07-19 14:50:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:38,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265399110] [2022-07-19 14:50:38,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:38,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:38,201 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-19 14:50:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:38,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265399110] [2022-07-19 14:50:38,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265399110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:50:38,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:50:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:50:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550041688] [2022-07-19 14:50:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:50:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:50:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:50:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:50:38,204 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-19 14:50:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:38,219 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-07-19 14:50:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:50:38,220 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-19 14:50:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:38,220 INFO L225 Difference]: With dead ends: 66 [2022-07-19 14:50:38,221 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 14:50:38,221 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-19 14:50:38,222 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-19 14:50:38,222 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-19 14:50:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 14:50:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-07-19 14:50:38,225 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-19 14:50:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-07-19 14:50:38,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 19 [2022-07-19 14:50:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:38,226 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-07-19 14:50:38,226 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-19 14:50:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-07-19 14:50:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:50:38,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:38,227 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-19 14:50:38,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:50:38,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1960843935, now seen corresponding path program 1 times [2022-07-19 14:50:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:38,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202441227] [2022-07-19 14:50:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:38,273 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-19 14:50:38,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:38,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202441227] [2022-07-19 14:50:38,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202441227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:38,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032206566] [2022-07-19 14:50:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:38,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:38,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:38,275 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-19 14:50:38,293 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-19 14:50:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:38,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:50:38,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:38,375 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-19 14:50:38,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:38,391 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-19 14:50:38,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032206566] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:38,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:38,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-19 14:50:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228257656] [2022-07-19 14:50:38,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:38,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 14:50:38,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 14:50:38,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:50:38,393 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-19 14:50:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:38,477 INFO L93 Difference]: Finished difference Result 114 states and 146 transitions. [2022-07-19 14:50:38,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:50:38,477 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-19 14:50:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:38,478 INFO L225 Difference]: With dead ends: 114 [2022-07-19 14:50:38,478 INFO L226 Difference]: Without dead ends: 86 [2022-07-19 14:50:38,478 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-19 14:50:38,479 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-19 14:50:38,479 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-19 14:50:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-19 14:50:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2022-07-19 14:50:38,485 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-19 14:50:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2022-07-19 14:50:38,485 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 22 [2022-07-19 14:50:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:38,486 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2022-07-19 14:50:38,486 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-19 14:50:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-07-19 14:50:38,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 14:50:38,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:38,487 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-19 14:50:38,516 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-19 14:50:38,707 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-19 14:50:38,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1926841972, now seen corresponding path program 1 times [2022-07-19 14:50:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:38,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002208823] [2022-07-19 14:50:38,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:38,766 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-19 14:50:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:38,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002208823] [2022-07-19 14:50:38,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002208823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429608820] [2022-07-19 14:50:38,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:38,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:38,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:38,769 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-19 14:50:38,783 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-19 14:50:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:38,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:50:38,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:38,906 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-19 14:50:38,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:38,931 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-19 14:50:38,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429608820] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:38,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:38,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 14:50:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977179753] [2022-07-19 14:50:38,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:38,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:50:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:50:38,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:50:38,934 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-19 14:50:39,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:39,081 INFO L93 Difference]: Finished difference Result 181 states and 231 transitions. [2022-07-19 14:50:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:50:39,081 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-19 14:50:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:39,084 INFO L225 Difference]: With dead ends: 181 [2022-07-19 14:50:39,084 INFO L226 Difference]: Without dead ends: 159 [2022-07-19 14:50:39,085 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-19 14:50:39,086 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-19 14:50:39,087 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-19 14:50:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-19 14:50:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 75. [2022-07-19 14:50:39,103 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-19 14:50:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-07-19 14:50:39,103 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 22 [2022-07-19 14:50:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:39,104 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-07-19 14:50:39,104 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-19 14:50:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-07-19 14:50:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 14:50:39,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:39,108 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-19 14:50:39,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 14:50:39,325 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-19 14:50:39,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1234267636, now seen corresponding path program 1 times [2022-07-19 14:50:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:39,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083043917] [2022-07-19 14:50:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:39,386 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-19 14:50:39,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083043917] [2022-07-19 14:50:39,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083043917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:39,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423326272] [2022-07-19 14:50:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:39,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:39,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:39,388 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-19 14:50:39,389 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-19 14:50:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:39,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:50:39,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:39,491 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-19 14:50:39,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:39,523 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-19 14:50:39,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423326272] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:39,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:39,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 14:50:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776077834] [2022-07-19 14:50:39,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:39,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:50:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:50:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:50:39,525 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-19 14:50:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:39,623 INFO L93 Difference]: Finished difference Result 206 states and 263 transitions. [2022-07-19 14:50:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:50:39,623 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-19 14:50:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:39,624 INFO L225 Difference]: With dead ends: 206 [2022-07-19 14:50:39,624 INFO L226 Difference]: Without dead ends: 146 [2022-07-19 14:50:39,625 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-19 14:50:39,625 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-19 14:50:39,625 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-19 14:50:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-19 14:50:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 92. [2022-07-19 14:50:39,633 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-19 14:50:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 119 transitions. [2022-07-19 14:50:39,633 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 119 transitions. Word has length 23 [2022-07-19 14:50:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:39,634 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 119 transitions. [2022-07-19 14:50:39,634 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-19 14:50:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 119 transitions. [2022-07-19 14:50:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:50:39,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:39,635 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-19 14:50:39,655 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-19 14:50:39,855 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-19 14:50:39,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:39,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1741027445, now seen corresponding path program 1 times [2022-07-19 14:50:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:39,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389800444] [2022-07-19 14:50:39,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:40,167 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-19 14:50:40,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389800444] [2022-07-19 14:50:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389800444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:40,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402199910] [2022-07-19 14:50:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:40,196 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-19 14:50:40,197 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-19 14:50:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:40,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 14:50:40,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:40,287 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-19 14:50:40,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-19 14:50:40,408 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:50:40,408 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-19 14:50:40,514 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-19 14:50:40,544 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-19 14:50:40,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:42,612 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-19 14:50:42,997 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-19 14:50:49,120 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-19 14:50:49,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402199910] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:49,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:49,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2022-07-19 14:50:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953559977] [2022-07-19 14:50:49,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 14:50:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 14:50:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=365, Unknown=7, NotChecked=82, Total=552 [2022-07-19 14:50:49,122 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-19 14:50:49,429 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-19 14:50:49,715 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-19 14:50:51,726 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-19 14:50:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:51,840 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-07-19 14:50:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:50:51,841 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-19 14:50:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:51,841 INFO L225 Difference]: With dead ends: 112 [2022-07-19 14:50:51,841 INFO L226 Difference]: Without dead ends: 100 [2022-07-19 14:50:51,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=141, Invalid=519, Unknown=10, NotChecked=260, Total=930 [2022-07-19 14:50:51,842 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:50:51,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 200 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2022-07-19 14:50:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-19 14:50:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-19 14:50:51,848 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-19 14:50:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2022-07-19 14:50:51,849 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 25 [2022-07-19 14:50:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:51,849 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2022-07-19 14:50:51,850 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-19 14:50:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2022-07-19 14:50:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:50:51,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:51,850 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-19 14:50:51,877 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-19 14:50:52,067 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-19 14:50:52,067 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -858936254, now seen corresponding path program 2 times [2022-07-19 14:50:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:52,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813861784] [2022-07-19 14:50:52,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:52,184 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-19 14:50:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:52,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813861784] [2022-07-19 14:50:52,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813861784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:52,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217218899] [2022-07-19 14:50:52,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:50:52,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:52,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:52,186 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-19 14:50:52,204 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-19 14:50:52,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:50:52,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:50:52,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 14:50:52,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:52,279 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-19 14:50:52,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:52,315 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-19 14:50:52,384 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-19 14:50:52,395 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-19 14:50:52,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:54,503 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-19 14:50:54,510 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-19 14:50:54,512 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-19 14:50:54,538 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-19 14:50:54,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217218899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:54,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:54,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2022-07-19 14:50:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508616956] [2022-07-19 14:50:54,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:54,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:50:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:54,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:50:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2022-07-19 14:50:54,540 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-19 14:50:56,558 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-19 14:50:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:56,743 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-07-19 14:50:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:50:56,743 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-19 14:50:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:56,745 INFO L225 Difference]: With dead ends: 145 [2022-07-19 14:50:56,745 INFO L226 Difference]: Without dead ends: 143 [2022-07-19 14:50:56,746 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-19 14:50:56,746 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:50:56,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 172 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 242 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2022-07-19 14:50:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-19 14:50:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 84. [2022-07-19 14:50:56,760 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-19 14:50:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-07-19 14:50:56,761 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 25 [2022-07-19 14:50:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:56,761 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-07-19 14:50:56,762 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-19 14:50:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-07-19 14:50:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:50:56,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:56,764 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-19 14:50:56,784 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-19 14:50:56,981 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-19 14:50:56,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1096380170, now seen corresponding path program 2 times [2022-07-19 14:50:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:56,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667023428] [2022-07-19 14:50:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:57,032 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-19 14:50:57,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:57,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667023428] [2022-07-19 14:50:57,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667023428] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:57,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703991440] [2022-07-19 14:50:57,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:50:57,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:57,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:57,035 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-19 14:50:57,036 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-19 14:50:57,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:50:57,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:50:57,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 14:50:57,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:57,173 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-19 14:50:57,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:57,201 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-19 14:50:57,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703991440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:57,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:57,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 14:50:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467914865] [2022-07-19 14:50:57,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:57,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:50:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:50:57,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 14:50:57,203 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-19 14:50:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:57,326 INFO L93 Difference]: Finished difference Result 183 states and 223 transitions. [2022-07-19 14:50:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 14:50:57,326 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-19 14:50:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:57,327 INFO L225 Difference]: With dead ends: 183 [2022-07-19 14:50:57,327 INFO L226 Difference]: Without dead ends: 170 [2022-07-19 14:50:57,327 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-19 14:50:57,328 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 122 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:50:57,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 178 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:50:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-19 14:50:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2022-07-19 14:50:57,337 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-19 14:50:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2022-07-19 14:50:57,337 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 28 [2022-07-19 14:50:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:57,337 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2022-07-19 14:50:57,338 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-19 14:50:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2022-07-19 14:50:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:50:57,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:57,338 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-19 14:50:57,376 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-19 14:50:57,551 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-19 14:50:57,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash 160714710, now seen corresponding path program 2 times [2022-07-19 14:50:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233590500] [2022-07-19 14:50:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:57,586 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-19 14:50:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:57,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233590500] [2022-07-19 14:50:57,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233590500] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:57,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449955616] [2022-07-19 14:50:57,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:50:57,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:57,589 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-19 14:50:57,609 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-19 14:50:57,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:50:57,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:50:57,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 14:50:57,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:57,721 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-19 14:50:57,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:50:57,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449955616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:50:57,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 14:50:57,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-07-19 14:50:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536674606] [2022-07-19 14:50:57,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:50:57,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:50:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:50:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:50:57,723 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-19 14:50:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:57,764 INFO L93 Difference]: Finished difference Result 213 states and 272 transitions. [2022-07-19 14:50:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:50:57,764 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-19 14:50:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:57,765 INFO L225 Difference]: With dead ends: 213 [2022-07-19 14:50:57,765 INFO L226 Difference]: Without dead ends: 130 [2022-07-19 14:50:57,768 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-19 14:50:57,768 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-19 14:50:57,769 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-19 14:50:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-19 14:50:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2022-07-19 14:50:57,778 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-19 14:50:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2022-07-19 14:50:57,779 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 29 [2022-07-19 14:50:57,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:57,780 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2022-07-19 14:50:57,780 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-19 14:50:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-07-19 14:50:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:50:57,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:57,781 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-19 14:50:57,814 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-19 14:50:58,014 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-19 14:50:58,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash 583416536, now seen corresponding path program 1 times [2022-07-19 14:50:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174678108] [2022-07-19 14:50:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:58,131 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-19 14:50:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174678108] [2022-07-19 14:50:58,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174678108] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967759958] [2022-07-19 14:50:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:58,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:58,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:58,134 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-19 14:50:58,135 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-19 14:50:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:58,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 14:50:58,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:58,229 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-19 14:50:58,286 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-19 14:50:58,298 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-19 14:50:58,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:50:58,357 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-19 14:50:58,360 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-19 14:50:58,428 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-19 14:50:58,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967759958] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:50:58,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:50:58,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-07-19 14:50:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114023183] [2022-07-19 14:50:58,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:50:58,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 14:50:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:50:58,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 14:50:58,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-07-19 14:50:58,431 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-19 14:50:58,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:50:58,670 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2022-07-19 14:50:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 14:50:58,671 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-19 14:50:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:50:58,672 INFO L225 Difference]: With dead ends: 200 [2022-07-19 14:50:58,672 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 14:50:58,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-07-19 14:50:58,673 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:50:58,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 255 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 246 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2022-07-19 14:50:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 14:50:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 164. [2022-07-19 14:50:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 163 states have internal predecessors, (210), 0 states have call successors, (0), 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-19 14:50:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 210 transitions. [2022-07-19 14:50:58,688 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 210 transitions. Word has length 29 [2022-07-19 14:50:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:50:58,688 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 210 transitions. [2022-07-19 14:50:58,688 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-19 14:50:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 210 transitions. [2022-07-19 14:50:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 14:50:58,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:50:58,690 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-19 14:50:58,709 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-19 14:50:58,907 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-19 14:50:58,907 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:50:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:50:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772930, now seen corresponding path program 3 times [2022-07-19 14:50:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:50:58,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866610112] [2022-07-19 14:50:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:50:58,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:50:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:50:59,543 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-19 14:50:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:50:59,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866610112] [2022-07-19 14:50:59,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866610112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:50:59,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964992312] [2022-07-19 14:50:59,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:50:59,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:50:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:50:59,545 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-19 14:50:59,548 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-19 14:50:59,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 14:50:59,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:50:59,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 14:50:59,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:50:59,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2022-07-19 14:50:59,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:59,717 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-19 14:50:59,718 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-19 14:50:59,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:50:59,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:50:59,874 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:50:59,874 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-19 14:50:59,968 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-19 14:50:59,969 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-19 14:51:00,747 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-19 14:51:00,768 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-19 14:51:00,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:51:31,636 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-19 14:51:31,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964992312] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:51:31,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:51:31,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 46 [2022-07-19 14:51:31,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090556031] [2022-07-19 14:51:31,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:51:31,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 14:51:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 14:51:31,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1692, Unknown=17, NotChecked=0, Total=2070 [2022-07-19 14:51:31,638 INFO L87 Difference]: Start difference. First operand 164 states and 210 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-19 14:51:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:33,677 INFO L93 Difference]: Finished difference Result 344 states and 433 transitions. [2022-07-19 14:51:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-19 14:51:33,678 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-19 14:51:33,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:33,679 INFO L225 Difference]: With dead ends: 344 [2022-07-19 14:51:33,679 INFO L226 Difference]: Without dead ends: 310 [2022-07-19 14:51:33,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=1020, Invalid=4364, Unknown=18, NotChecked=0, Total=5402 [2022-07-19 14:51:33,681 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 196 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:33,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 378 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 283 Invalid, 0 Unknown, 355 Unchecked, 0.1s Time] [2022-07-19 14:51:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-19 14:51:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 189. [2022-07-19 14:51:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.303191489361702) internal successors, (245), 188 states have internal predecessors, (245), 0 states have call successors, (0), 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-19 14:51:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2022-07-19 14:51:33,696 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 31 [2022-07-19 14:51:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:33,697 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2022-07-19 14:51:33,697 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-19 14:51:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2022-07-19 14:51:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 14:51:33,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:33,698 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-19 14:51:33,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-19 14:51:33,915 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-19 14:51:33,916 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -956621735, now seen corresponding path program 1 times [2022-07-19 14:51:33,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:33,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778535055] [2022-07-19 14:51:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:33,962 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-19 14:51:33,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:33,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778535055] [2022-07-19 14:51:33,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778535055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:51:33,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:51:33,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:51:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463225861] [2022-07-19 14:51:33,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:51:33,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:51:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:33,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:51:33,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:51:33,964 INFO L87 Difference]: Start difference. First operand 189 states and 245 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-19 14:51:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:34,013 INFO L93 Difference]: Finished difference Result 308 states and 396 transitions. [2022-07-19 14:51:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:51:34,014 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-19 14:51:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:34,015 INFO L225 Difference]: With dead ends: 308 [2022-07-19 14:51:34,015 INFO L226 Difference]: Without dead ends: 214 [2022-07-19 14:51:34,015 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-19 14:51:34,016 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:34,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:51:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-19 14:51:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 189. [2022-07-19 14:51:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 188 states have internal predecessors, (243), 0 states have call successors, (0), 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-19 14:51:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 243 transitions. [2022-07-19 14:51:34,032 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 243 transitions. Word has length 31 [2022-07-19 14:51:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:34,032 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 243 transitions. [2022-07-19 14:51:34,032 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-19 14:51:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2022-07-19 14:51:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:51:34,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:34,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:51:34,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 14:51:34,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1438437486, now seen corresponding path program 2 times [2022-07-19 14:51:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:34,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541968382] [2022-07-19 14:51:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:51:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:34,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541968382] [2022-07-19 14:51:34,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541968382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:51:34,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592953118] [2022-07-19 14:51:34,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:51:34,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:51:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:51:34,079 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-19 14:51:34,080 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-19 14:51:34,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:51:34,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:51:34,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:51:34,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:51:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:51:34,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:51:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:51:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592953118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:51:34,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:51:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 14:51:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672044014] [2022-07-19 14:51:34,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:51:34,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 14:51:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 14:51:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:51:34,236 INFO L87 Difference]: Start difference. First operand 189 states and 243 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:51:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:34,448 INFO L93 Difference]: Finished difference Result 467 states and 590 transitions. [2022-07-19 14:51:34,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:51:34,448 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-19 14:51:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:34,451 INFO L225 Difference]: With dead ends: 467 [2022-07-19 14:51:34,451 INFO L226 Difference]: Without dead ends: 433 [2022-07-19 14:51:34,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-19 14:51:34,453 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 195 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:34,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 311 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:51:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-19 14:51:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 223. [2022-07-19 14:51:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2972972972972974) internal successors, (288), 222 states have internal predecessors, (288), 0 states have call successors, (0), 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-19 14:51:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 288 transitions. [2022-07-19 14:51:34,473 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 288 transitions. Word has length 32 [2022-07-19 14:51:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:34,473 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 288 transitions. [2022-07-19 14:51:34,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:51:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 288 transitions. [2022-07-19 14:51:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 14:51:34,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:34,474 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-19 14:51:34,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 14:51:34,691 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-19 14:51:34,691 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1777758610, now seen corresponding path program 3 times [2022-07-19 14:51:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:34,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893458230] [2022-07-19 14:51:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:34,766 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-19 14:51:34,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:34,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893458230] [2022-07-19 14:51:34,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893458230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:51:34,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469853100] [2022-07-19 14:51:34,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:51:34,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:51:34,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:51:34,772 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-19 14:51:34,773 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-19 14:51:34,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 14:51:34,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:51:34,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:51:34,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:51:34,906 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-19 14:51:34,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:51:34,940 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-19 14:51:34,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469853100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:51:34,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:51:34,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 14:51:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337072970] [2022-07-19 14:51:34,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:51:34,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 14:51:34,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 14:51:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:51:34,942 INFO L87 Difference]: Start difference. First operand 223 states and 288 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-19 14:51:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:35,114 INFO L93 Difference]: Finished difference Result 497 states and 630 transitions. [2022-07-19 14:51:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:51:35,115 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-19 14:51:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:35,117 INFO L225 Difference]: With dead ends: 497 [2022-07-19 14:51:35,117 INFO L226 Difference]: Without dead ends: 364 [2022-07-19 14:51:35,119 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-19 14:51:35,120 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 213 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:35,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 151 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:51:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-19 14:51:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 256. [2022-07-19 14:51:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.2862745098039217) internal successors, (328), 255 states have internal predecessors, (328), 0 states have call successors, (0), 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-19 14:51:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 328 transitions. [2022-07-19 14:51:35,143 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 328 transitions. Word has length 33 [2022-07-19 14:51:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:35,143 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 328 transitions. [2022-07-19 14:51:35,143 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-19 14:51:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 328 transitions. [2022-07-19 14:51:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:51:35,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:35,144 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-19 14:51:35,161 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-19 14:51:35,362 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-19 14:51:35,363 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1071791489, now seen corresponding path program 4 times [2022-07-19 14:51:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:35,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963777905] [2022-07-19 14:51:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:35,424 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-19 14:51:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963777905] [2022-07-19 14:51:35,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963777905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:51:35,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077829509] [2022-07-19 14:51:35,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 14:51:35,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:51:35,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:51:35,427 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-19 14:51:35,428 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-19 14:51:35,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 14:51:35,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:51:35,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:51:35,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:51:35,539 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-19 14:51:35,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:51:35,584 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-19 14:51:35,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077829509] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:51:35,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:51:35,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 14:51:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17025149] [2022-07-19 14:51:35,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:51:35,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 14:51:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 14:51:35,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-19 14:51:35,586 INFO L87 Difference]: Start difference. First operand 256 states and 328 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-19 14:51:35,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:35,819 INFO L93 Difference]: Finished difference Result 547 states and 686 transitions. [2022-07-19 14:51:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 14:51:35,819 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-19 14:51:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:35,821 INFO L225 Difference]: With dead ends: 547 [2022-07-19 14:51:35,821 INFO L226 Difference]: Without dead ends: 526 [2022-07-19 14:51:35,821 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-19 14:51:35,822 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:35,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 306 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:51:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-07-19 14:51:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 353. [2022-07-19 14:51:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 1.3068181818181819) internal successors, (460), 352 states have internal predecessors, (460), 0 states have call successors, (0), 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-19 14:51:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 460 transitions. [2022-07-19 14:51:35,850 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 460 transitions. Word has length 34 [2022-07-19 14:51:35,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:35,851 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 460 transitions. [2022-07-19 14:51:35,851 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-19 14:51:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 460 transitions. [2022-07-19 14:51:35,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 14:51:35,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:35,852 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-19 14:51:35,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 14:51:36,080 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-19 14:51:36,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash -715108188, now seen corresponding path program 2 times [2022-07-19 14:51:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:36,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360019761] [2022-07-19 14:51:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:51:36,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:36,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360019761] [2022-07-19 14:51:36,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360019761] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:51:36,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164322710] [2022-07-19 14:51:36,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:51:36,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:51:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:51:36,609 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-19 14:51:36,610 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-19 14:51:36,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:51:36,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:51:36,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 14:51:36,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:51:36,695 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 84 treesize of output 76 [2022-07-19 14:51:36,715 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-19 14:51:36,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:36,774 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-19 14:51:36,888 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:51:36,888 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-19 14:51:36,943 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:51:36,944 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-19 14:51:37,034 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-19 14:51:37,048 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-19 14:51:37,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:51:45,434 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-19 14:51:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164322710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:51:45,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:51:45,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 14] total 36 [2022-07-19 14:51:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113004094] [2022-07-19 14:51:45,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:51:45,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-19 14:51:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-19 14:51:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1031, Unknown=4, NotChecked=0, Total=1260 [2022-07-19 14:51:45,436 INFO L87 Difference]: Start difference. First operand 353 states and 460 transitions. Second operand has 36 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:51:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:46,649 INFO L93 Difference]: Finished difference Result 830 states and 1042 transitions. [2022-07-19 14:51:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-19 14:51:46,650 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 14:51:46,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:46,652 INFO L225 Difference]: With dead ends: 830 [2022-07-19 14:51:46,652 INFO L226 Difference]: Without dead ends: 810 [2022-07-19 14:51:46,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1082, Invalid=3470, Unknown=4, NotChecked=0, Total=4556 [2022-07-19 14:51:46,653 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 561 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 564 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:46,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 537 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 453 Invalid, 0 Unknown, 564 Unchecked, 0.3s Time] [2022-07-19 14:51:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-19 14:51:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 429. [2022-07-19 14:51:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 1.338785046728972) internal successors, (573), 428 states have internal predecessors, (573), 0 states have call successors, (0), 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-19 14:51:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 573 transitions. [2022-07-19 14:51:46,694 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 573 transitions. Word has length 34 [2022-07-19 14:51:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:46,694 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 573 transitions. [2022-07-19 14:51:46,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5) internal successors, (90), 36 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:51:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 573 transitions. [2022-07-19 14:51:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:51:46,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:46,696 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:51:46,713 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-19 14:51:46,909 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-19 14:51:46,909 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2122200076, now seen corresponding path program 4 times [2022-07-19 14:51:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:46,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566653814] [2022-07-19 14:51:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:51:47,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:47,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566653814] [2022-07-19 14:51:47,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566653814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:51:47,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209666562] [2022-07-19 14:51:47,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 14:51:47,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:51:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:51:47,034 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-19 14:51:47,059 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-19 14:51:47,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 14:51:47,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:51:47,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 14:51:47,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:51:47,120 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-19 14:51:47,153 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-07-19 14:51:47,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-07-19 14:51:47,517 INFO L356 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2022-07-19 14:51:47,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-19 14:51:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:51:47,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:51:47,881 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-19 14:51:47,883 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-19 14:51:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:51:47,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209666562] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:51:47,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:51:47,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 17] total 39 [2022-07-19 14:51:47,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134948311] [2022-07-19 14:51:47,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:51:47,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 14:51:47,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:51:47,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 14:51:47,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1275, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 14:51:47,930 INFO L87 Difference]: Start difference. First operand 429 states and 573 transitions. Second operand has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 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-19 14:51:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:51:49,163 INFO L93 Difference]: Finished difference Result 590 states and 768 transitions. [2022-07-19 14:51:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-19 14:51:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 14:51:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:51:49,165 INFO L225 Difference]: With dead ends: 590 [2022-07-19 14:51:49,165 INFO L226 Difference]: Without dead ends: 588 [2022-07-19 14:51:49,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2532 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1351, Invalid=6131, Unknown=0, NotChecked=0, Total=7482 [2022-07-19 14:51:49,167 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 336 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:51:49,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 579 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 608 Invalid, 0 Unknown, 447 Unchecked, 0.3s Time] [2022-07-19 14:51:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-19 14:51:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 454. [2022-07-19 14:51:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.3311258278145695) internal successors, (603), 453 states have internal predecessors, (603), 0 states have call successors, (0), 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-19 14:51:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 603 transitions. [2022-07-19 14:51:49,214 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 603 transitions. Word has length 35 [2022-07-19 14:51:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:51:49,214 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 603 transitions. [2022-07-19 14:51:49,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 0 states have call successors, (0), 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-19 14:51:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 603 transitions. [2022-07-19 14:51:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:51:49,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:51:49,216 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-19 14:51:49,235 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-19 14:51:49,431 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-19 14:51:49,432 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:51:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:51:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1136182421, now seen corresponding path program 5 times [2022-07-19 14:51:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:51:49,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391213080] [2022-07-19 14:51:49,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:51:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:51:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:51:50,041 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-19 14:51:50,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:51:50,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391213080] [2022-07-19 14:51:50,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391213080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:51:50,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892261943] [2022-07-19 14:51:50,041 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 14:51:50,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:51:50,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:51:50,042 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-19 14:51:50,043 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-19 14:51:50,274 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-19 14:51:50,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:51:50,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-19 14:51:50,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:51:50,290 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 84 treesize of output 76 [2022-07-19 14:51:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-07-19 14:51:50,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:51:50,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,464 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:51:50,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 63 [2022-07-19 14:51:50,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:51:50,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,573 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:51:50,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 [2022-07-19 14:51:50,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:51:50,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:51:50,688 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-19 14:51:50,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 61 [2022-07-19 14:51:51,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2022-07-19 14:51:51,129 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-19 14:51:51,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:52:44,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_709 Int) (v_ArrVal_707 Int) (v_ArrVal_705 Int) (|v_ULTIMATE.start_main_~x~0#1_41| 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_705))) (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_41|)) (<= 0 (select (let ((.cse1 (store .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_41| 4)) v_ArrVal_707))) (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 4 (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)))) v_ArrVal_709)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) is different from false [2022-07-19 14:53:33,597 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-19 14:53:33,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892261943] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:53:33,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:53:33,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 21] total 51 [2022-07-19 14:53:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832609364] [2022-07-19 14:53:33,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:53:33,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 14:53:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:53:33,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 14:53:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=1939, Unknown=36, NotChecked=96, Total=2550 [2022-07-19 14:53:33,599 INFO L87 Difference]: Start difference. First operand 454 states and 603 transitions. Second operand has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 51 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-19 14:53:34,136 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (= |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) (forall ((v_ArrVal_709 Int) (v_ArrVal_707 Int) (v_ArrVal_705 Int) (|v_ULTIMATE.start_main_~x~0#1_41| Int)) (let ((.cse1 (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_705))) (or (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_41|)) (<= 0 (select (let ((.cse2 (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_41| 4)) v_ArrVal_707))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 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| 8)))) v_ArrVal_709)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))) (= (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))) is different from false [2022-07-19 14:53:34,654 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#Dest~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#distance~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~#Dest~0#1.offset|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 4)) 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) 0) 0) (= 4 (select .cse0 (+ |c_ULTIMATE.start_main_~#Dest~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#Dest~0#1.offset| 0) (forall ((v_ArrVal_709 Int) (v_ArrVal_707 Int) (v_ArrVal_705 Int) (|v_ULTIMATE.start_main_~x~0#1_41| Int)) (let ((.cse1 (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_705))) (or (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_41|)) (<= 0 (select (let ((.cse2 (store .cse1 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* |v_ULTIMATE.start_main_~x~0#1_41| 4)) v_ArrVal_707))) (store .cse2 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 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| 8)))) v_ArrVal_709)) |c_ULTIMATE.start_main_~#distance~0#1.offset|))))))) is different from false [2022-07-19 14:53:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:53:35,642 INFO L93 Difference]: Finished difference Result 505 states and 661 transitions. [2022-07-19 14:53:35,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 14:53:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 51 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-19 14:53:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:53:35,643 INFO L225 Difference]: With dead ends: 505 [2022-07-19 14:53:35,644 INFO L226 Difference]: Without dead ends: 471 [2022-07-19 14:53:35,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 104.6s TimeCoverageRelationStatistics Valid=919, Invalid=3747, Unknown=38, NotChecked=408, Total=5112 [2022-07-19 14:53:35,645 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 154 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:53:35,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 361 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 396 Invalid, 0 Unknown, 275 Unchecked, 0.2s Time] [2022-07-19 14:53:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-07-19 14:53:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 452. [2022-07-19 14:53:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.3325942350332594) internal successors, (601), 451 states have internal predecessors, (601), 0 states have call successors, (0), 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-19 14:53:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 601 transitions. [2022-07-19 14:53:35,693 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 601 transitions. Word has length 37 [2022-07-19 14:53:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:53:35,693 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 601 transitions. [2022-07-19 14:53:35,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 51 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-19 14:53:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 601 transitions. [2022-07-19 14:53:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:53:35,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:53:35,694 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-19 14:53:35,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 14:53:35,905 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-19 14:53:35,906 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:53:35,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:53:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1630806470, now seen corresponding path program 1 times [2022-07-19 14:53:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:53:35,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37481325] [2022-07-19 14:53:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:53:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:53:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:53:36,914 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-19 14:53:36,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:53:36,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37481325] [2022-07-19 14:53:36,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37481325] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:53:36,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689393221] [2022-07-19 14:53:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:53:36,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:53:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:53:36,917 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:53:36,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 14:53:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:53:37,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-19 14:53:37,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:53:37,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-19 14:53:37,105 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 14:53:37,105 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-19 14:53:37,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:53:37,218 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 14:53:37,218 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-19 14:53:37,416 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-19 14:53:37,417 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-19 14:53:37,614 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-19 14:53:37,614 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-19 14:53:37,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:53:37,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:53:37,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:53:37,622 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-19 14:53:37,624 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-19 14:53:37,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:53:47,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)) (forall ((v_ArrVal_763 Int) (v_ArrVal_765 Int)) (or (not (<= (+ v_ArrVal_765 1) 0)) (let ((.cse0 (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_179| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_763))) (store .cse2 (+ (* (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) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_765)))) (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| (* 4 (select (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 4 (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|)))))))))))) is different from false [2022-07-19 14:54:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-07-19 14:54:01,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689393221] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:54:01,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:54:01,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-07-19 14:54:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006097923] [2022-07-19 14:54:01,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:54:01,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-19 14:54:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:54:01,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-19 14:54:01,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=621, Unknown=10, NotChecked=52, Total=812 [2022-07-19 14:54:01,647 INFO L87 Difference]: Start difference. First operand 452 states and 601 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-19 14:54:03,678 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_~#Source~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) 0) (= |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_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~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) (not (= |c_ULTIMATE.start_main_~#distance~0#1.base| |c_ULTIMATE.start_main_~#Weight~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|)) (forall ((v_ArrVal_763 Int) (v_ArrVal_765 Int)) (or (not (<= (+ v_ArrVal_765 1) 0)) (let ((.cse0 (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#distance~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_179| 4) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_763))) (store .cse2 (+ (* (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) |c_ULTIMATE.start_main_~#distance~0#1.offset|) v_ArrVal_765)))) (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| (* 4 (select (select .cse1 |c_ULTIMATE.start_main_~#Dest~0#1.base|) |c_ULTIMATE.start_main_~#Dest~0#1.offset|)))) (+ (select (select .cse1 |c_ULTIMATE.start_main_~#Weight~0#1.base|) |c_ULTIMATE.start_main_~#Weight~0#1.offset|) (select .cse0 (+ |c_ULTIMATE.start_main_~#distance~0#1.offset| (* 4 (select (select .cse1 |c_ULTIMATE.start_main_~#Source~0#1.base|) |c_ULTIMATE.start_main_~#Source~0#1.offset|)))))))))))) (= |c_ULTIMATE.start_main_~#Weight~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#Source~0#1.offset| 0)) is different from false [2022-07-19 14:54:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:54:04,766 INFO L93 Difference]: Finished difference Result 653 states and 839 transitions. [2022-07-19 14:54:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 14:54:04,768 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-19 14:54:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:54:04,769 INFO L225 Difference]: With dead ends: 653 [2022-07-19 14:54:04,769 INFO L226 Difference]: Without dead ends: 588 [2022-07-19 14:54:04,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=418, Invalid=1649, Unknown=11, NotChecked=178, Total=2256 [2022-07-19 14:54:04,772 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 177 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:54:04,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 460 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 307 Invalid, 0 Unknown, 333 Unchecked, 0.3s Time] [2022-07-19 14:54:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-19 14:54:04,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 465. [2022-07-19 14:54:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3232758620689655) internal successors, (614), 464 states have internal predecessors, (614), 0 states have call successors, (0), 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-19 14:54:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 614 transitions. [2022-07-19 14:54:04,829 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 614 transitions. Word has length 38 [2022-07-19 14:54:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:54:04,830 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 614 transitions. [2022-07-19 14:54:04,830 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-19 14:54:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 614 transitions. [2022-07-19 14:54:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:54:04,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:54:04,831 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-19 14:54:04,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 14:54:05,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:54:05,045 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:54:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:54:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 670016120, now seen corresponding path program 1 times [2022-07-19 14:54:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:54:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133802662] [2022-07-19 14:54:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:54:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:54:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:54:05,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 14:54:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 14:54:05,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 14:54:05,116 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 14:54:05,116 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:54:05,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 14:54:05,120 INFO L356 BasicCegarLoop]: Path program histogram: [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-19 14:54:05,122 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:54:05,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:54:05 BoogieIcfgContainer [2022-07-19 14:54:05,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:54:05,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:54:05,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:54:05,183 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:54:05,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:50:36" (3/4) ... [2022-07-19 14:54:05,184 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 14:54:05,234 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:54:05,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:54:05,237 INFO L158 Benchmark]: Toolchain (without parser) took 209119.86ms. Allocated memory was 107.0MB in the beginning and 222.3MB in the end (delta: 115.3MB). Free memory was 77.6MB in the beginning and 71.7MB in the end (delta: 5.9MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,237 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:54:05,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.18ms. Allocated memory was 107.0MB in the beginning and 165.7MB in the end (delta: 58.7MB). Free memory was 77.6MB in the beginning and 138.2MB in the end (delta: -60.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.47ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 135.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,238 INFO L158 Benchmark]: Boogie Preprocessor took 27.31ms. Allocated memory is still 165.7MB. Free memory was 135.8MB in the beginning and 134.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,238 INFO L158 Benchmark]: RCFGBuilder took 312.03ms. Allocated memory is still 165.7MB. Free memory was 134.0MB in the beginning and 119.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,239 INFO L158 Benchmark]: TraceAbstraction took 208457.85ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 118.6MB in the beginning and 75.9MB in the end (delta: 42.6MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,239 INFO L158 Benchmark]: Witness Printer took 52.17ms. Allocated memory is still 222.3MB. Free memory was 75.9MB in the beginning and 71.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 14:54:05,244 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.18ms. Allocated memory was 107.0MB in the beginning and 165.7MB in the end (delta: 58.7MB). Free memory was 77.6MB in the beginning and 138.2MB in the end (delta: -60.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.47ms. Allocated memory is still 165.7MB. Free memory was 138.2MB in the beginning and 135.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.31ms. Allocated memory is still 165.7MB. Free memory was 135.8MB in the beginning and 134.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.03ms. Allocated memory is still 165.7MB. Free memory was 134.0MB in the beginning and 119.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 208457.85ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 118.6MB in the beginning and 75.9MB in the end (delta: 42.6MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. * Witness Printer took 52.17ms. Allocated memory is still 222.3MB. Free memory was 75.9MB in the beginning and 71.7MB 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={21:0}, source=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=0, Source={21: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={21:0}, source=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={21:0}, source=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=0, Source={21:0}, Weight={25:0}] [L39] 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}] [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=0, Source={21: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=0, Source={21: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={21:0}, source=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={21:0}, source=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={21:0}, source=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={21:0}, source=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={21:0}, source=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: 208.3s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2835 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2835 mSDsluCounter, 4669 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2243 IncrementalHoareTripleChecker+Unchecked, 3976 mSDsCounter, 953 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4248 IncrementalHoareTripleChecker+Invalid, 7444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 953 mSolverCounterUnsat, 693 mSDtfsCounter, 4248 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1394 GetRequests, 805 SyntacticMatches, 39 SemanticMatches, 550 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 8102 ImplicationChecksByTransitivity, 192.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=20, InterpolantAutomatonStates: 359, 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, 20 MinimizatonAttempts, 1683 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 185.4s InterpolantComputationTime, 1093 NumberOfCodeBlocks, 1090 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1469 ConstructedInterpolants, 136 QuantifiedInterpolants, 19070 SizeOfPredicates, 165 NumberOfNonLiveVariables, 4663 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 53 InterpolantComputations, 4 PerfectInterpolantSequences, 246/660 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-19 14:54:05,361 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