./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr3.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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:22:53,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:22:53,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:22:53,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:22:53,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:22:53,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:22:53,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:22:53,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:22:53,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:22:53,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:22:53,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:22:53,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:22:53,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:22:53,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:22:53,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:22:53,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:22:53,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:22:53,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:22:53,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:22:53,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:22:53,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:22:53,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:22:53,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:22:53,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:22:53,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:22:53,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:22:53,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:22:53,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:22:53,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:22:53,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:22:53,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:22:53,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:22:53,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:22:53,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:22:53,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:22:53,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:22:53,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:22:53,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:22:53,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:22:53,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:22:53,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:22:53,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:22:53,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 22:22:53,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:22:53,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:22:53,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:22:53,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:22:53,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:22:53,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:22:53,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:22:53,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:22:53,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:22:53,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:22:53,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:22:53,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:22:53,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:22:53,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:22:53,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:22:53,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:22:53,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:22:53,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:22:53,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:22:53,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:22:53,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:22:53,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:22:53,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:22:53,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:22:53,407 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:22:53,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:22:53,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:22:53,408 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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2022-07-11 22:22:53,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:22:53,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:22:53,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:22:53,583 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:22:53,584 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:22:53,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr3.c [2022-07-11 22:22:53,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c877a2566/6ac2673a90f9469c928e89a7b0674771/FLAG18690fb30 [2022-07-11 22:22:53,975 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:22:53,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2022-07-11 22:22:53,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c877a2566/6ac2673a90f9469c928e89a7b0674771/FLAG18690fb30 [2022-07-11 22:22:54,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c877a2566/6ac2673a90f9469c928e89a7b0674771 [2022-07-11 22:22:54,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:22:54,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:22:54,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:22:54,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:22:54,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:22:54,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2301302a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54, skipping insertion in model container [2022-07-11 22:22:54,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:22:54,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:22:54,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2022-07-11 22:22:54,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:22:54,569 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:22:54,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c[394,407] [2022-07-11 22:22:54,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:22:54,599 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:22:54,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54 WrapperNode [2022-07-11 22:22:54,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:22:54,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:22:54,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:22:54,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:22:54,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,634 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-11 22:22:54,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:22:54,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:22:54,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:22:54,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:22:54,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:22:54,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:22:54,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:22:54,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:22:54,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (1/1) ... [2022-07-11 22:22:54,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:22:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:54,688 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-11 22:22:54,708 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-11 22:22:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:22:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:22:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:22:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:22:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:22:54,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:22:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:22:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:22:54,762 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:22:54,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:22:54,855 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:22:54,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:22:54,860 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 22:22:54,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:22:54 BoogieIcfgContainer [2022-07-11 22:22:54,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:22:54,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:22:54,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:22:54,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:22:54,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:22:54" (1/3) ... [2022-07-11 22:22:54,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a835522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:22:54, skipping insertion in model container [2022-07-11 22:22:54,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:22:54" (2/3) ... [2022-07-11 22:22:54,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a835522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:22:54, skipping insertion in model container [2022-07-11 22:22:54,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:22:54" (3/3) ... [2022-07-11 22:22:54,868 INFO L111 eAbstractionObserver]: Analyzing ICFG nr3.c [2022-07-11 22:22:54,878 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:22:54,878 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:22:54,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:22:54,933 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@78943301, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53b1caad [2022-07-11 22:22:54,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:22:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 22:22:54,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:54,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:54,949 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-11 22:22:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:54,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121136060] [2022-07-11 22:22:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:54,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:55,153 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-11 22:22:55,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:55,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121136060] [2022-07-11 22:22:55,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121136060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:55,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:55,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:22:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158655549] [2022-07-11 22:22:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:22:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:22:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:22:55,198 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:55,215 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-11 22:22:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:22:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-11 22:22:55,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:55,224 INFO L225 Difference]: With dead ends: 45 [2022-07-11 22:22:55,224 INFO L226 Difference]: Without dead ends: 20 [2022-07-11 22:22:55,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:22:55,241 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:55,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-11 22:22:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-11 22:22:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-11 22:22:55,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-11 22:22:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:55,270 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-11 22:22:55,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-11 22:22:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 22:22:55,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:55,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:55,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:22:55,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-11 22:22:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:55,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18617697] [2022-07-11 22:22:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:55,376 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-11 22:22:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:55,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18617697] [2022-07-11 22:22:55,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18617697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:55,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:55,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:22:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245353227] [2022-07-11 22:22:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:55,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:22:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:22:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:22:55,379 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:55,412 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-11 22:22:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:22:55,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-11 22:22:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:55,414 INFO L225 Difference]: With dead ends: 29 [2022-07-11 22:22:55,414 INFO L226 Difference]: Without dead ends: 27 [2022-07-11 22:22:55,414 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-11 22:22:55,416 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:55,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-11 22:22:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-11 22:22:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-11 22:22:55,420 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-11 22:22:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:55,421 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-11 22:22:55,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-11 22:22:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 22:22:55,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:55,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:55,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 22:22:55,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:55,423 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-11 22:22:55,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:55,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277089212] [2022-07-11 22:22:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:55,547 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-11 22:22:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:55,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277089212] [2022-07-11 22:22:55,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277089212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:55,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:55,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 22:22:55,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490255156] [2022-07-11 22:22:55,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:55,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 22:22:55,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:55,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 22:22:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:22:55,552 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. 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-11 22:22:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:55,597 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-11 22:22:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:22:55,598 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-11 22:22:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:55,598 INFO L225 Difference]: With dead ends: 38 [2022-07-11 22:22:55,598 INFO L226 Difference]: Without dead ends: 27 [2022-07-11 22:22:55,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-11 22:22:55,600 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:55,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-11 22:22:55,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-11 22:22:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-11 22:22:55,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-11 22:22:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:55,604 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-11 22:22:55,604 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-11 22:22:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-11 22:22:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 22:22:55,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:55,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:55,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 22:22:55,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:55,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-11 22:22:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683390066] [2022-07-11 22:22:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:55,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:55,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683390066] [2022-07-11 22:22:55,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683390066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:55,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:22:55,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:22:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915936065] [2022-07-11 22:22:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:55,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:22:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:55,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:22:55,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:22:55,646 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:55,660 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-11 22:22:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:22:55,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-11 22:22:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:55,661 INFO L225 Difference]: With dead ends: 42 [2022-07-11 22:22:55,661 INFO L226 Difference]: Without dead ends: 26 [2022-07-11 22:22:55,662 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-11 22:22:55,663 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:55,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-11 22:22:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-11 22:22:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-11 22:22:55,668 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-11 22:22:55,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:55,669 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-11 22:22:55,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,669 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-11 22:22:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 22:22:55,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:55,670 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-11 22:22:55,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 22:22:55,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-11 22:22:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:55,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185485120] [2022-07-11 22:22:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:55,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:55,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185485120] [2022-07-11 22:22:55,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185485120] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:55,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960200105] [2022-07-11 22:22:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:55,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:55,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:55,748 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-11 22:22:55,749 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-11 22:22:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:55,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:22:55,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:55,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:22:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:55,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960200105] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:22:55,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:22:55,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-11 22:22:55,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820879397] [2022-07-11 22:22:55,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:22:55,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 22:22:55,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:55,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 22:22:55,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:22:55,893 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:55,914 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-11 22:22:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:22:55,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-11 22:22:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:55,915 INFO L225 Difference]: With dead ends: 47 [2022-07-11 22:22:55,915 INFO L226 Difference]: Without dead ends: 30 [2022-07-11 22:22:55,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:22:55,916 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:55,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-11 22:22:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-11 22:22:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-11 22:22:55,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 19 [2022-07-11 22:22:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:55,921 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-11 22:22:55,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:22:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-11 22:22:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 22:22:55,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:55,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:55,942 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-11 22:22:56,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:56,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1797589728, now seen corresponding path program 2 times [2022-07-11 22:22:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:56,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742812745] [2022-07-11 22:22:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:56,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742812745] [2022-07-11 22:22:56,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742812745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:56,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630727533] [2022-07-11 22:22:56,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:22:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:56,227 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-11 22:22:56,228 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-11 22:22:56,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:22:56,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:22:56,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 22:22:56,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:56,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:22:56,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630727533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:22:56,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 22:22:56,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-11 22:22:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679125443] [2022-07-11 22:22:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:22:56,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 22:22:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:22:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 22:22:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-11 22:22:56,366 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11 22:22:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:22:56,398 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-11 22:22:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 22:22:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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 25 [2022-07-11 22:22:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:22:56,399 INFO L225 Difference]: With dead ends: 53 [2022-07-11 22:22:56,400 INFO L226 Difference]: Without dead ends: 30 [2022-07-11 22:22:56,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-11 22:22:56,404 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:22:56,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:22:56,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-11 22:22:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-11 22:22:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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-11 22:22:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-11 22:22:56,418 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 25 [2022-07-11 22:22:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:22:56,419 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-11 22:22:56,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11 22:22:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-11 22:22:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 22:22:56,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:22:56,421 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:22:56,440 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-11 22:22:56,631 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,SelfDestructingSolverStorable5 [2022-07-11 22:22:56,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:22:56,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:22:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1796312990, now seen corresponding path program 1 times [2022-07-11 22:22:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:22:56,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074235056] [2022-07-11 22:22:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:22:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:22:56,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074235056] [2022-07-11 22:22:56,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074235056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:22:56,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229835574] [2022-07-11 22:22:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:22:56,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:22:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:22:56,959 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-11 22:22:56,960 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-11 22:22:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:22:57,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 22:22:57,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:22:57,099 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-11 22:22:57,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:22:57,162 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 31 treesize of output 30 [2022-07-11 22:22:57,215 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-11 22:22:57,215 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 24 treesize of output 29 [2022-07-11 22:22:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:22:57,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:14,221 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 55 treesize of output 51 [2022-07-11 22:23:14,247 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 391 treesize of output 383 [2022-07-11 22:23:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:23:16,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229835574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:16,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:16,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2022-07-11 22:23:16,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385881740] [2022-07-11 22:23:16,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:16,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-11 22:23:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-11 22:23:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=892, Unknown=4, NotChecked=0, Total=1056 [2022-07-11 22:23:16,494 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 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-11 22:23:24,893 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 52 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 22:23:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:27,224 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-07-11 22:23:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 22:23:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 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-11 22:23:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:27,225 INFO L225 Difference]: With dead ends: 85 [2022-07-11 22:23:27,226 INFO L226 Difference]: Without dead ends: 62 [2022-07-11 22:23:27,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=343, Invalid=1632, Unknown=5, NotChecked=0, Total=1980 [2022-07-11 22:23:27,227 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:27,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 314 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-07-11 22:23:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-11 22:23:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 34. [2022-07-11 22:23:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:23:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-11 22:23:27,233 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2022-07-11 22:23:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:27,233 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-11 22:23:27,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 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-11 22:23:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-11 22:23:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:23:27,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:27,234 INFO L195 NwaCegarLoop]: trace histogram [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-11 22:23:27,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 22:23:27,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:27,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1325174645, now seen corresponding path program 1 times [2022-07-11 22:23:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:27,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955523017] [2022-07-11 22:23:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955523017] [2022-07-11 22:23:27,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955523017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393373129] [2022-07-11 22:23:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:27,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:27,700 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-11 22:23:27,724 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-11 22:23:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:27,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-11 22:23:27,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:27,846 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 16 treesize of output 12 [2022-07-11 22:23:27,896 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-11 22:23:27,896 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 26 treesize of output 31 [2022-07-11 22:23:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:28,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:31,697 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 39 treesize of output 35 [2022-07-11 22:23:31,699 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 75 treesize of output 67 [2022-07-11 22:23:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:23:31,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393373129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:31,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:31,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 31 [2022-07-11 22:23:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716272600] [2022-07-11 22:23:31,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-11 22:23:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-11 22:23:31,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-07-11 22:23:31,821 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 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-11 22:23:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:32,201 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-11 22:23:32,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-11 22:23:32,201 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 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-11 22:23:32,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:32,203 INFO L225 Difference]: With dead ends: 118 [2022-07-11 22:23:32,203 INFO L226 Difference]: Without dead ends: 93 [2022-07-11 22:23:32,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 22:23:32,204 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:32,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 188 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2022-07-11 22:23:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-11 22:23:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2022-07-11 22:23:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 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-11 22:23:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-07-11 22:23:32,222 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 31 [2022-07-11 22:23:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:32,224 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-07-11 22:23:32,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 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-11 22:23:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-07-11 22:23:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:23:32,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:32,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:32,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-11 22:23:32,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:32,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash 932147635, now seen corresponding path program 1 times [2022-07-11 22:23:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:32,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993665070] [2022-07-11 22:23:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:32,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993665070] [2022-07-11 22:23:32,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993665070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024212905] [2022-07-11 22:23:32,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:32,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:32,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:32,663 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-11 22:23:32,663 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-11 22:23:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:32,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-11 22:23:32,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:32,735 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-11 22:23:32,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:32,784 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 31 treesize of output 30 [2022-07-11 22:23:32,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:32,815 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 24 treesize of output 23 [2022-07-11 22:23:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:32,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:54,059 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 38 treesize of output 36 [2022-07-11 22:23:54,062 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 880 treesize of output 872 [2022-07-11 22:23:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:54,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024212905] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:54,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:54,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-07-11 22:23:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646422700] [2022-07-11 22:23:54,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:54,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-11 22:23:54,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:54,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-11 22:23:54,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=729, Unknown=11, NotChecked=0, Total=870 [2022-07-11 22:23:54,141 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 22:23:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:54,676 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2022-07-11 22:23:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 22:23:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 22:23:54,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:54,679 INFO L225 Difference]: With dead ends: 136 [2022-07-11 22:23:54,679 INFO L226 Difference]: Without dead ends: 126 [2022-07-11 22:23:54,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=334, Invalid=1725, Unknown=11, NotChecked=0, Total=2070 [2022-07-11 22:23:54,680 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 190 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:54,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 191 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 386 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2022-07-11 22:23:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-11 22:23:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 80. [2022-07-11 22:23:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:23:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2022-07-11 22:23:54,690 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 31 [2022-07-11 22:23:54,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:54,693 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2022-07-11 22:23:54,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 states have internal predecessors, (77), 0 states have call successors, (0), 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-11 22:23:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2022-07-11 22:23:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 22:23:54,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:54,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:54,714 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-11 22:23:54,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:54,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:54,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1798450104, now seen corresponding path program 2 times [2022-07-11 22:23:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:54,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764347021] [2022-07-11 22:23:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:55,034 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:55,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764347021] [2022-07-11 22:23:55,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764347021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:55,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335664317] [2022-07-11 22:23:55,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:23:55,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:55,036 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-11 22:23:55,037 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-11 22:23:55,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:23:55,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:55,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-11 22:23:55,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:55,118 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 16 treesize of output 12 [2022-07-11 22:23:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:55,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:55,243 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 17 [2022-07-11 22:23:55,245 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 34 treesize of output 30 [2022-07-11 22:23:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:55,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335664317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:55,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:55,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-07-11 22:23:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579095527] [2022-07-11 22:23:55,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:55,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-11 22:23:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-11 22:23:55,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-11 22:23:55,344 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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-11 22:23:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:56,429 INFO L93 Difference]: Finished difference Result 264 states and 310 transitions. [2022-07-11 22:23:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-07-11 22:23:56,430 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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 37 [2022-07-11 22:23:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:56,431 INFO L225 Difference]: With dead ends: 264 [2022-07-11 22:23:56,431 INFO L226 Difference]: Without dead ends: 262 [2022-07-11 22:23:56,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=921, Invalid=4481, Unknown=0, NotChecked=0, Total=5402 [2022-07-11 22:23:56,433 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 268 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:56,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 218 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 22:23:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-11 22:23:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 119. [2022-07-11 22:23:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:23:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2022-07-11 22:23:56,464 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 37 [2022-07-11 22:23:56,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:56,464 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2022-07-11 22:23:56,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 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-11 22:23:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-07-11 22:23:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:23:56,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:56,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:56,483 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-11 22:23:56,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:56,670 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:56,670 INFO L85 PathProgramCache]: Analyzing trace with hash 996077275, now seen corresponding path program 3 times [2022-07-11 22:23:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:56,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175655399] [2022-07-11 22:23:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 22:23:56,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:56,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175655399] [2022-07-11 22:23:56,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175655399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:56,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011810486] [2022-07-11 22:23:56,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:23:56,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:56,882 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-11 22:23:56,907 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-11 22:23:56,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-11 22:23:56,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:56,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 22:23:56,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 22:23:57,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:23:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 22:23:57,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011810486] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:23:57,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:23:57,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-07-11 22:23:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679907077] [2022-07-11 22:23:57,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:23:57,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 22:23:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:23:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 22:23:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2022-07-11 22:23:57,375 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:23:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:23:57,565 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2022-07-11 22:23:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 22:23:57,566 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-11 22:23:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:23:57,567 INFO L225 Difference]: With dead ends: 182 [2022-07-11 22:23:57,567 INFO L226 Difference]: Without dead ends: 152 [2022-07-11 22:23:57,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2022-07-11 22:23:57,568 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 239 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:23:57,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 165 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:23:57,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-11 22:23:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2022-07-11 22:23:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.238532110091743) internal successors, (135), 109 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:23:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2022-07-11 22:23:57,585 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 43 [2022-07-11 22:23:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:23:57,586 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-07-11 22:23:57,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 22:23:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-07-11 22:23:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:23:57,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:23:57,587 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:23:57,603 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-11 22:23:57,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:57,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:23:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:23:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash -218220002, now seen corresponding path program 4 times [2022-07-11 22:23:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:23:57,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751722526] [2022-07-11 22:23:57,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:23:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:23:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:23:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:23:58,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:23:58,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751722526] [2022-07-11 22:23:58,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751722526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:23:58,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855854222] [2022-07-11 22:23:58,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:23:58,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:23:58,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:23:58,226 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-11 22:23:58,227 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-11 22:23:58,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:23:58,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:23:58,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-11 22:23:58,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:23:58,358 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 16 treesize of output 12 [2022-07-11 22:23:58,403 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-11 22:23:58,403 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 31 treesize of output 36 [2022-07-11 22:23:58,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:58,566 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-11 22:23:58,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2022-07-11 22:23:58,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:23:58,644 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 38 treesize of output 31 [2022-07-11 22:23:58,708 INFO L356 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-07-11 22:23:58,709 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 38 treesize of output 41 [2022-07-11 22:24:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:24:07,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:25:15,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) is different from false [2022-07-11 22:25:46,163 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 99 treesize of output 95 [2022-07-11 22:25:46,169 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 3911 treesize of output 3879 [2022-07-11 22:25:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 60 refuted. 2 times theorem prover too weak. 2 trivial. 2 not checked. [2022-07-11 22:25:52,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855854222] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:25:52,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:25:52,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 51 [2022-07-11 22:25:52,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6349789] [2022-07-11 22:25:52,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:25:52,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-11 22:25:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:25:52,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-11 22:25:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2061, Unknown=62, NotChecked=96, Total=2550 [2022-07-11 22:25:52,998 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 22:26:12,264 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (and (<= 2 .cse2) (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0))) (= .cse2 0))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 5 (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4)) (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 2 (select .cse3 4)))) is different from false [2022-07-11 22:26:21,215 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse2 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2)))) is different from false [2022-07-11 22:26:23,219 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse2 (select .cse3 4))) (or (= .cse2 0) (<= 2 .cse2))) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (let ((.cse4 (select .cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (and (<= 2 .cse4) (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0))) (= .cse4 0))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2))) is different from false [2022-07-11 22:26:30,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (let ((.cse2 (select .cse1 4))) (let ((.cse3 (<= 2 .cse2))) (and (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (or (= .cse2 0) .cse3) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse4 (select (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 0) (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse5 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (= .cse4 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse4) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|))))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (or .cse3 (= (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 4)) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0))))))) is different from false [2022-07-11 22:26:32,436 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse1 (select (let ((.cse2 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse1 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3))))) is different from false [2022-07-11 22:26:34,440 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))))) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse2) (= .cse2 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0)))) is different from false [2022-07-11 22:26:40,502 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 12 |c_ULTIMATE.start_main_~i~0#1|)))) (and (= (select .cse2 .cse3) 0) (= .cse3 4))) (<= 2 (select .cse2 4))))) is different from false [2022-07-11 22:26:42,531 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4))) (or (= .cse2 0) (<= 2 .cse2))) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) is different from false [2022-07-11 22:26:47,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse2 (select (let ((.cse3 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse2 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= (+ 5 (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4)) (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 2 (select .cse1 4)) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0))))) is different from false [2022-07-11 22:27:04,407 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse1 (select (let ((.cse2 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse2 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse1) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse1 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0)))) is different from false [2022-07-11 22:27:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:27:18,751 INFO L93 Difference]: Finished difference Result 219 states and 269 transitions. [2022-07-11 22:27:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-11 22:27:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 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 43 [2022-07-11 22:27:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:27:18,753 INFO L225 Difference]: With dead ends: 219 [2022-07-11 22:27:18,753 INFO L226 Difference]: Without dead ends: 217 [2022-07-11 22:27:18,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 195.1s TimeCoverageRelationStatistics Valid=643, Invalid=3721, Unknown=102, NotChecked=1540, Total=6006 [2022-07-11 22:27:18,755 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:27:18,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 256 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 263 Invalid, 0 Unknown, 342 Unchecked, 0.2s Time] [2022-07-11 22:27:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-11 22:27:18,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 150. [2022-07-11 22:27:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.261744966442953) internal successors, (188), 149 states have internal predecessors, (188), 0 states have call successors, (0), 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-11 22:27:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 188 transitions. [2022-07-11 22:27:18,772 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 188 transitions. Word has length 43 [2022-07-11 22:27:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:27:18,772 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 188 transitions. [2022-07-11 22:27:18,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 22:27:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 188 transitions. [2022-07-11 22:27:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:27:18,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:27:18,773 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:27:18,810 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-11 22:27:18,973 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,SelfDestructingSolverStorable11 [2022-07-11 22:27:18,974 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:27:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:27:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash -611247012, now seen corresponding path program 2 times [2022-07-11 22:27:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:27:18,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337830875] [2022-07-11 22:27:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:27:18,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:27:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:27:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 22:27:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:27:19,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337830875] [2022-07-11 22:27:19,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337830875] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:27:19,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932905731] [2022-07-11 22:27:19,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:27:19,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:27:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:27:19,287 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-11 22:27:19,287 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-11 22:27:19,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:27:19,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:27:19,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-11 22:27:19,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:27:19,411 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 16 treesize of output 12 [2022-07-11 22:27:19,445 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-11 22:27:19,445 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 31 treesize of output 36 [2022-07-11 22:27:19,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:27:19,583 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-11 22:27:19,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2022-07-11 22:27:19,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:27:19,653 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 38 treesize of output 31 [2022-07-11 22:27:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:27:19,701 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 38 treesize of output 31 [2022-07-11 22:27:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 22:27:19,896 INFO L328 TraceCheckSpWp]: Computing backward predicates...