./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/reducercommutativity/rangesum20.i -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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-15 23:43:34,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 23:43:34,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 23:43:34,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 23:43:34,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 23:43:34,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 23:43:34,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 23:43:34,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 23:43:34,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 23:43:34,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 23:43:34,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 23:43:34,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 23:43:34,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 23:43:34,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 23:43:34,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 23:43:34,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 23:43:34,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 23:43:34,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 23:43:34,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 23:43:34,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 23:43:34,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 23:43:34,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 23:43:34,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 23:43:34,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 23:43:34,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 23:43:34,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 23:43:34,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 23:43:34,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 23:43:34,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 23:43:34,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 23:43:34,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 23:43:34,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 23:43:34,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 23:43:34,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 23:43:34,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 23:43:34,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 23:43:34,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 23:43:34,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 23:43:34,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 23:43:34,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 23:43:34,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 23:43:34,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 23:43:34,689 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 23:43:34,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 23:43:34,690 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 23:43:34,690 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 23:43:34,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 23:43:34,691 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 23:43:34,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 23:43:34,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 23:43:34,692 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 23:43:34,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 23:43:34,693 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 23:43:34,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 23:43:34,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 23:43:34,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 23:43:34,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 23:43:34,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 23:43:34,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 23:43:34,695 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 23:43:34,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 23:43:34,695 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 23:43:34,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 23:43:34,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 23:43:34,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 23:43:34,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 23:43:34,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 23:43:34,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 23:43:34,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 23:43:34,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 23:43:34,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 23:43:34,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 23:43:34,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 23:43:34,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 23:43:34,698 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 23:43:34,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 23:43:34,698 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 23:43:34,698 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2023-02-15 23:43:34,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 23:43:34,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 23:43:34,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 23:43:34,979 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 23:43:34,979 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 23:43:34,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2023-02-15 23:43:36,142 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 23:43:36,351 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 23:43:36,351 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2023-02-15 23:43:36,356 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69aaa1343/ad8348869bd147d59deafc584a255815/FLAG5e2abd1cc [2023-02-15 23:43:36,378 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69aaa1343/ad8348869bd147d59deafc584a255815 [2023-02-15 23:43:36,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 23:43:36,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 23:43:36,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 23:43:36,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 23:43:36,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 23:43:36,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec5f407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36, skipping insertion in model container [2023-02-15 23:43:36,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 23:43:36,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 23:43:36,569 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2023-02-15 23:43:36,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:43:36,580 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 23:43:36,597 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i[1465,1478] [2023-02-15 23:43:36,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 23:43:36,610 INFO L208 MainTranslator]: Completed translation [2023-02-15 23:43:36,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36 WrapperNode [2023-02-15 23:43:36,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 23:43:36,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 23:43:36,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 23:43:36,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 23:43:36,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,637 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2023-02-15 23:43:36,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 23:43:36,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 23:43:36,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 23:43:36,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 23:43:36,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 23:43:36,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 23:43:36,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 23:43:36,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 23:43:36,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (1/1) ... [2023-02-15 23:43:36,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 23:43:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:36,705 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) [2023-02-15 23:43:36,711 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 [2023-02-15 23:43:36,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 23:43:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 23:43:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 23:43:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 23:43:36,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 23:43:36,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 23:43:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 23:43:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-02-15 23:43:36,736 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-02-15 23:43:36,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 23:43:36,803 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 23:43:36,804 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 23:43:36,943 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 23:43:36,954 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 23:43:36,964 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 23:43:36,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:43:36 BoogieIcfgContainer [2023-02-15 23:43:36,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 23:43:36,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 23:43:36,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 23:43:36,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 23:43:36,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:43:36" (1/3) ... [2023-02-15 23:43:36,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4469c82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:43:36, skipping insertion in model container [2023-02-15 23:43:36,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:43:36" (2/3) ... [2023-02-15 23:43:36,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4469c82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:43:36, skipping insertion in model container [2023-02-15 23:43:36,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:43:36" (3/3) ... [2023-02-15 23:43:36,990 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2023-02-15 23:43:37,022 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 23:43:37,022 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 23:43:37,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 23:43:37,086 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f1631a7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 23:43:37,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 23:43:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 23:43:37,097 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:37,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:37,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2023-02-15 23:43:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:37,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519739435] [2023-02-15 23:43:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:37,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519739435] [2023-02-15 23:43:37,232 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 23:43:37,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674437440] [2023-02-15 23:43:37,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:37,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:37,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:37,237 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) [2023-02-15 23:43:37,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 23:43:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:37,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 23:43:37,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 23:43:37,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:43:37,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674437440] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:43:37,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:43:37,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 23:43:37,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129888143] [2023-02-15 23:43:37,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:43:37,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 23:43:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 23:43:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 23:43:37,409 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:37,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:37,426 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2023-02-15 23:43:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 23:43:37,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-15 23:43:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:37,434 INFO L225 Difference]: With dead ends: 52 [2023-02-15 23:43:37,434 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 23:43:37,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 23:43:37,440 INFO L413 NwaCegarLoop]: 34 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, 34 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 [2023-02-15 23:43:37,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 23:43:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-02-15 23:43:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-02-15 23:43:37,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2023-02-15 23:43:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:37,482 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-02-15 23:43:37,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-02-15 23:43:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 23:43:37,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:37,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:37,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:37,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 23:43:37,694 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:37,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1257002967, now seen corresponding path program 1 times [2023-02-15 23:43:37,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:37,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862161176] [2023-02-15 23:43:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:37,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:37,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862161176] [2023-02-15 23:43:37,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 23:43:37,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074682014] [2023-02-15 23:43:37,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:37,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:37,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:37,733 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) [2023-02-15 23:43:37,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 23:43:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:37,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:43:37,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 23:43:37,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:43:37,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074682014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:43:37,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:43:37,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 23:43:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790781884] [2023-02-15 23:43:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:43:37,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 23:43:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 23:43:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:37,887 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 23:43:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:37,900 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2023-02-15 23:43:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 23:43:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-02-15 23:43:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:37,902 INFO L225 Difference]: With dead ends: 46 [2023-02-15 23:43:37,903 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 23:43:37,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:37,905 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:37,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 23:43:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-15 23:43:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:37,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-02-15 23:43:37,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2023-02-15 23:43:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:37,917 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-02-15 23:43:37,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 23:43:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-02-15 23:43:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 23:43:37,920 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:37,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:37,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:38,125 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,SelfDestructingSolverStorable1 [2023-02-15 23:43:38,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:38,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:38,126 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2023-02-15 23:43:38,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:38,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618486988] [2023-02-15 23:43:38,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:38,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:38,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618486988] [2023-02-15 23:43:38,192 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 23:43:38,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427248625] [2023-02-15 23:43:38,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:38,197 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) [2023-02-15 23:43:38,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 23:43:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:38,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:43:38,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 23:43:38,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:43:38,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427248625] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:43:38,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:43:38,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 23:43:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110323721] [2023-02-15 23:43:38,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:43:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 23:43:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:38,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 23:43:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:38,314 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:38,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:38,339 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2023-02-15 23:43:38,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 23:43:38,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2023-02-15 23:43:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:38,342 INFO L225 Difference]: With dead ends: 46 [2023-02-15 23:43:38,342 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 23:43:38,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:38,348 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:38,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 23:43:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-02-15 23:43:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-02-15 23:43:38,365 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2023-02-15 23:43:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:38,366 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-02-15 23:43:38,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-02-15 23:43:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 23:43:38,369 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:38,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:38,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:38,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:38,576 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2023-02-15 23:43:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:38,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787494117] [2023-02-15 23:43:38,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:38,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:38,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:38,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787494117] [2023-02-15 23:43:38,602 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 23:43:38,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321760158] [2023-02-15 23:43:38,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:38,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:38,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:38,605 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) [2023-02-15 23:43:38,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 23:43:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:38,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 23:43:38,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:38,738 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 23:43:38,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:43:38,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321760158] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:43:38,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:43:38,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 23:43:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835731527] [2023-02-15 23:43:38,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:43:38,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 23:43:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 23:43:38,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:38,744 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:38,759 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2023-02-15 23:43:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 23:43:38,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-02-15 23:43:38,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:38,762 INFO L225 Difference]: With dead ends: 44 [2023-02-15 23:43:38,762 INFO L226 Difference]: Without dead ends: 29 [2023-02-15 23:43:38,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:38,766 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:38,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 53 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-15 23:43:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-02-15 23:43:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-02-15 23:43:38,774 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2023-02-15 23:43:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:38,780 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-02-15 23:43:38,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-02-15 23:43:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 23:43:38,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:38,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:38,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:38,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:38,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:38,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:38,989 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2023-02-15 23:43:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:38,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073565504] [2023-02-15 23:43:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:39,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073565504] [2023-02-15 23:43:39,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-02-15 23:43:39,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814331785] [2023-02-15 23:43:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:39,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:39,025 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) [2023-02-15 23:43:39,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 23:43:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:43:39,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 23:43:39,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 23:43:39,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814331785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 23:43:39,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 23:43:39,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 23:43:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772373206] [2023-02-15 23:43:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 23:43:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 23:43:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 23:43:39,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:39,141 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:39,162 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2023-02-15 23:43:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 23:43:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2023-02-15 23:43:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:39,166 INFO L225 Difference]: With dead ends: 55 [2023-02-15 23:43:39,166 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 23:43:39,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 23:43:39,168 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:39,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 23:43:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-15 23:43:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-02-15 23:43:39,183 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2023-02-15 23:43:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:39,184 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-02-15 23:43:39,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 23:43:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-02-15 23:43:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 23:43:39,186 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:39,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:39,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:39,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:39,389 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2023-02-15 23:43:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694972712] [2023-02-15 23:43:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-02-15 23:43:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 23:43:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 23:43:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 23:43:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:39,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694972712] [2023-02-15 23:43:39,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694972712] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:43:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527535134] [2023-02-15 23:43:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:39,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:39,612 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) [2023-02-15 23:43:39,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 23:43:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:39,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:43:39,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 23:43:39,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-02-15 23:43:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527535134] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:39,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:43:39,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-02-15 23:43:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588021953] [2023-02-15 23:43:39,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:39,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 23:43:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 23:43:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 23:43:39,771 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 23:43:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:39,823 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2023-02-15 23:43:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 23:43:39,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2023-02-15 23:43:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:39,826 INFO L225 Difference]: With dead ends: 69 [2023-02-15 23:43:39,826 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 23:43:39,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 23:43:39,828 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:39,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 23:43:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-02-15 23:43:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2023-02-15 23:43:39,837 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2023-02-15 23:43:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2023-02-15 23:43:39,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 23:43:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2023-02-15 23:43:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 23:43:39,839 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:39,840 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:39,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:40,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:40,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:40,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2023-02-15 23:43:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429612652] [2023-02-15 23:43:40,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 23:43:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 23:43:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:40,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-02-15 23:43:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-02-15 23:43:40,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:40,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429612652] [2023-02-15 23:43:40,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429612652] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 23:43:40,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421981388] [2023-02-15 23:43:40,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:43:40,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:40,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:40,129 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) [2023-02-15 23:43:40,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 23:43:40,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:43:40,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:43:40,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:43:40,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-02-15 23:43:40,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-02-15 23:43:40,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421981388] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:40,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 23:43:40,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2023-02-15 23:43:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603693190] [2023-02-15 23:43:40,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:40,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 23:43:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 23:43:40,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 23:43:40,333 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 23:43:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:40,377 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2023-02-15 23:43:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 23:43:40,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2023-02-15 23:43:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:40,379 INFO L225 Difference]: With dead ends: 86 [2023-02-15 23:43:40,379 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 23:43:40,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 23:43:40,380 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:40,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 23:43:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2023-02-15 23:43:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-02-15 23:43:40,385 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 57 [2023-02-15 23:43:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:40,385 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-02-15 23:43:40,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 23:43:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-02-15 23:43:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-15 23:43:40,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:40,387 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:40,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:40,593 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2023-02-15 23:43:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125445233] [2023-02-15 23:43:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:40,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:40,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787324731] [2023-02-15 23:43:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:40,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:40,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:40,622 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) [2023-02-15 23:43:40,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 23:43:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:40,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:43:40,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-15 23:43:40,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-02-15 23:43:41,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:41,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125445233] [2023-02-15 23:43:41,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:41,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787324731] [2023-02-15 23:43:41,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787324731] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:41,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:41,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2023-02-15 23:43:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50436734] [2023-02-15 23:43:41,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:41,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 23:43:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 23:43:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-02-15 23:43:41,023 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 23:43:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:41,076 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2023-02-15 23:43:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 23:43:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 78 [2023-02-15 23:43:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:41,078 INFO L225 Difference]: With dead ends: 99 [2023-02-15 23:43:41,078 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 23:43:41,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-02-15 23:43:41,079 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:41,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 23:43:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-02-15 23:43:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2023-02-15 23:43:41,085 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 78 [2023-02-15 23:43:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:41,086 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2023-02-15 23:43:41,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 23:43:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2023-02-15 23:43:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-15 23:43:41,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:41,087 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:41,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:41,293 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,SelfDestructingSolverStorable7 [2023-02-15 23:43:41,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash -102117622, now seen corresponding path program 2 times [2023-02-15 23:43:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246359512] [2023-02-15 23:43:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:41,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:41,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564402301] [2023-02-15 23:43:41,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:43:41,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:41,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:41,321 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) [2023-02-15 23:43:41,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 23:43:41,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:43:41,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:43:41,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 23:43:41,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2023-02-15 23:43:41,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-02-15 23:43:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:41,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246359512] [2023-02-15 23:43:41,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:41,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564402301] [2023-02-15 23:43:41,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564402301] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:41,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:41,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-15 23:43:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460241001] [2023-02-15 23:43:41,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:41,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 23:43:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:41,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 23:43:41,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 23:43:41,506 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:43:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:41,539 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2023-02-15 23:43:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 23:43:41,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 98 [2023-02-15 23:43:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:41,542 INFO L225 Difference]: With dead ends: 109 [2023-02-15 23:43:41,542 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 23:43:41,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 23:43:41,547 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:41,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 23:43:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 23:43:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.064102564102564) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-15 23:43:41,557 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 98 [2023-02-15 23:43:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:41,558 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-15 23:43:41,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:43:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-15 23:43:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-02-15 23:43:41,560 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:41,560 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:41,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:41,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:41,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:41,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash 944957770, now seen corresponding path program 3 times [2023-02-15 23:43:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:41,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094764963] [2023-02-15 23:43:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:41,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:41,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180669010] [2023-02-15 23:43:41,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 23:43:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:41,796 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:43:41,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 23:43:41,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 23:43:41,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:43:41,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 23:43:41,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 332 proven. 1 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2023-02-15 23:43:41,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2023-02-15 23:43:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:41,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094764963] [2023-02-15 23:43:41,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:41,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180669010] [2023-02-15 23:43:41,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180669010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:41,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:41,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-15 23:43:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123443770] [2023-02-15 23:43:41,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:41,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 23:43:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:41,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 23:43:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 23:43:41,982 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 23:43:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:41,998 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2023-02-15 23:43:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 23:43:41,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2023-02-15 23:43:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:42,000 INFO L225 Difference]: With dead ends: 121 [2023-02-15 23:43:42,000 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 23:43:42,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 23:43:42,001 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:42,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 53 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 23:43:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-15 23:43:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 23:43:42,008 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 134 [2023-02-15 23:43:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:42,008 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 23:43:42,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 23:43:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 23:43:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-02-15 23:43:42,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:42,010 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:42,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:42,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 23:43:42,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1134191088, now seen corresponding path program 4 times [2023-02-15 23:43:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:42,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762819836] [2023-02-15 23:43:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:42,245 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:42,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1587934310] [2023-02-15 23:43:42,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 23:43:42,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:42,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:42,247 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:43:42,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 23:43:42,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 23:43:42,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:43:42,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 23:43:42,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2023-02-15 23:43:42,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2023-02-15 23:43:42,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:42,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762819836] [2023-02-15 23:43:42,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:42,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587934310] [2023-02-15 23:43:42,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587934310] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:42,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:42,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-02-15 23:43:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216617966] [2023-02-15 23:43:42,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:42,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 23:43:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 23:43:42,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 23:43:42,499 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:43:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:42,537 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2023-02-15 23:43:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 23:43:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 140 [2023-02-15 23:43:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:42,539 INFO L225 Difference]: With dead ends: 148 [2023-02-15 23:43:42,539 INFO L226 Difference]: Without dead ends: 104 [2023-02-15 23:43:42,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-15 23:43:42,540 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:42,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-15 23:43:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-02-15 23:43:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2023-02-15 23:43:42,547 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 140 [2023-02-15 23:43:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:42,547 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2023-02-15 23:43:42,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:43:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2023-02-15 23:43:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-02-15 23:43:42,549 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:42,549 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 33, 20, 20, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:42,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:42,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 23:43:42,756 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1554862939, now seen corresponding path program 5 times [2023-02-15 23:43:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:42,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761280385] [2023-02-15 23:43:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:42,783 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:42,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133986696] [2023-02-15 23:43:42,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 23:43:42,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:42,785 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:43:42,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 23:43:42,875 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-15 23:43:42,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:43:42,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 23:43:42,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:42,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1023 proven. 26 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2023-02-15 23:43:42,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 107 proven. 378 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2023-02-15 23:43:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:43,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761280385] [2023-02-15 23:43:43,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:43,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133986696] [2023-02-15 23:43:43,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133986696] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:43,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:43,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-02-15 23:43:43,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763584695] [2023-02-15 23:43:43,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:43,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 23:43:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 23:43:43,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 23:43:43,010 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:43:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:43,052 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2023-02-15 23:43:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 23:43:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 185 [2023-02-15 23:43:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:43,058 INFO L225 Difference]: With dead ends: 187 [2023-02-15 23:43:43,058 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 23:43:43,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 23:43:43,059 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:43,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 23:43:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-02-15 23:43:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.1056910569105691) internal successors, (136), 123 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2023-02-15 23:43:43,074 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 185 [2023-02-15 23:43:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:43,074 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2023-02-15 23:43:43,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 23:43:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2023-02-15 23:43:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-02-15 23:43:43,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:43,077 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:43,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:43,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 23:43:43,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:43,284 INFO L85 PathProgramCache]: Analyzing trace with hash -290085595, now seen corresponding path program 6 times [2023-02-15 23:43:43,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:43,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242848786] [2023-02-15 23:43:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:43,316 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:43,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185406732] [2023-02-15 23:43:43,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 23:43:43,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:43,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:43,318 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:43:43,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 23:43:43,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-02-15 23:43:43,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 23:43:43,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 23:43:43,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5921 backedges. 2490 proven. 16 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2023-02-15 23:43:43,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5921 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2023-02-15 23:43:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242848786] [2023-02-15 23:43:43,622 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:43,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185406732] [2023-02-15 23:43:43,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185406732] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:43,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:43,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 23:43:43,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551177571] [2023-02-15 23:43:43,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:43,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 23:43:43,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 23:43:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 23:43:43,625 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 23:43:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:43,653 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2023-02-15 23:43:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 23:43:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 257 [2023-02-15 23:43:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:43,655 INFO L225 Difference]: With dead ends: 211 [2023-02-15 23:43:43,655 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 23:43:43,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 23:43:43,656 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:43,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 23:43:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-02-15 23:43:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.0962962962962963) internal successors, (148), 135 states have internal predecessors, (148), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2023-02-15 23:43:43,665 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 257 [2023-02-15 23:43:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:43,666 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2023-02-15 23:43:43,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 23:43:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2023-02-15 23:43:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2023-02-15 23:43:43,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:43,669 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:43,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:43,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 23:43:43,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1965956505, now seen corresponding path program 7 times [2023-02-15 23:43:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:43,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613021051] [2023-02-15 23:43:43,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:43,927 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:43,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129261083] [2023-02-15 23:43:43,928 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 23:43:43,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:43,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:43,929 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:43:43,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 23:43:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 23:43:44,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 23:43:44,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 23:43:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 2490 proven. 100 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2023-02-15 23:43:44,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 23:43:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2023-02-15 23:43:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 23:43:44,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613021051] [2023-02-15 23:43:44,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 23:43:44,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129261083] [2023-02-15 23:43:44,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129261083] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 23:43:44,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 23:43:44,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-02-15 23:43:44,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052369646] [2023-02-15 23:43:44,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 23:43:44,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 23:43:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 23:43:44,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 23:43:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2023-02-15 23:43:44,383 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 23:43:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 23:43:44,434 INFO L93 Difference]: Finished difference Result 229 states and 262 transitions. [2023-02-15 23:43:44,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 23:43:44,434 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 269 [2023-02-15 23:43:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 23:43:44,435 INFO L225 Difference]: With dead ends: 229 [2023-02-15 23:43:44,435 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 23:43:44,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 514 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2023-02-15 23:43:44,437 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 23:43:44,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 23:43:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 23:43:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2023-02-15 23:43:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 153 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 23:43:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2023-02-15 23:43:44,443 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 269 [2023-02-15 23:43:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 23:43:44,443 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2023-02-15 23:43:44,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 23:43:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2023-02-15 23:43:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2023-02-15 23:43:44,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 23:43:44,447 INFO L195 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 23:43:44,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:44,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:44,654 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 23:43:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 23:43:44,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1541531655, now seen corresponding path program 8 times [2023-02-15 23:43:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 23:43:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720101997] [2023-02-15 23:43:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 23:43:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 23:43:44,686 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 23:43:44,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376719778] [2023-02-15 23:43:44,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 23:43:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 23:43:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 23:43:44,688 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 23:43:44,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 23:43:50,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 23:43:50,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 23:43:50,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 23:43:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 23:43:55,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 23:43:55,583 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 23:43:55,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 23:43:55,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 23:43:55,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 23:43:55,812 INFO L445 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1, 1] [2023-02-15 23:43:55,815 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 23:43:55,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:43:55 BoogieIcfgContainer [2023-02-15 23:43:55,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 23:43:55,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 23:43:55,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 23:43:55,965 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 23:43:55,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:43:36" (3/4) ... [2023-02-15 23:43:55,967 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 23:43:56,079 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 23:43:56,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 23:43:56,081 INFO L158 Benchmark]: Toolchain (without parser) took 19698.62ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 104.1MB in the beginning and 114.1MB in the end (delta: -10.0MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2023-02-15 23:43:56,081 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 70.1MB in the beginning and 70.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 23:43:56,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.09ms. Allocated memory is still 130.0MB. Free memory was 104.1MB in the beginning and 93.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 23:43:56,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.64ms. Allocated memory is still 130.0MB. Free memory was 93.3MB in the beginning and 91.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 23:43:56,082 INFO L158 Benchmark]: Boogie Preprocessor took 40.35ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 90.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 23:43:56,083 INFO L158 Benchmark]: RCFGBuilder took 288.02ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 78.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 23:43:56,083 INFO L158 Benchmark]: TraceAbstraction took 18995.57ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 77.8MB in the beginning and 127.6MB in the end (delta: -49.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2023-02-15 23:43:56,083 INFO L158 Benchmark]: Witness Printer took 115.42ms. Allocated memory is still 188.7MB. Free memory was 127.6MB in the beginning and 114.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 23:43:56,087 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 102.8MB. Free memory was 70.1MB in the beginning and 70.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.09ms. Allocated memory is still 130.0MB. Free memory was 104.1MB in the beginning and 93.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.64ms. Allocated memory is still 130.0MB. Free memory was 93.3MB in the beginning and 91.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.35ms. Allocated memory is still 130.0MB. Free memory was 91.9MB in the beginning and 90.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.02ms. Allocated memory is still 130.0MB. Free memory was 90.4MB in the beginning and 78.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18995.57ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 77.8MB in the beginning and 127.6MB in the end (delta: -49.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 115.42ms. Allocated memory is still 188.7MB. Free memory was 127.6MB in the beginning and 114.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={3:0}, x={3:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={3:0}, x={3:0}] [L17] COND FALSE !(i < 20) VAL [i=20, x={3:0}, x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=21, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=21, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=21, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=2147483576, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=2147483576, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=2147483576, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=2147483594, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=2147483594, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=2147483594, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=2147483611, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=2147483611, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=2147483611, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=2147483622, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=2147483622, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=2147483622, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=4294967269, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=4294967269, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=4294967269, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=2147483623, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=2147483623, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=2147483623, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-24, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-24, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-24, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-10, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-10, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-10, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-1, cnt=9, i=20, ret=-10, x={3:0}, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [rangesum(x)=-1, x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp VAL [ret=-1, temp=19, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=21, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=21, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=21, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=2147483576, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=2147483576, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=2147483576, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=2147483594, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=2147483594, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=2147483594, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=2147483611, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=2147483611, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=2147483611, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=2147483622, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=2147483622, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=2147483622, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=4294967269, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=4294967269, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=4294967269, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=2147483623, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=2147483623, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=2147483623, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-24, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-24, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-24, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=-10, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=-10, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-10, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-1, cnt=9, i=20, ret=-10, x={3:0}, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [rangesum(x)=-1, ret=-1, temp=19, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret=-1, ret2=-1, temp=31, x={3:0}] [L54] COND FALSE !(i<20 -1) VAL [i=19, ret=-1, ret2=-1, temp=31, x={3:0}] [L57] x[20 -1] = temp VAL [i=19, ret=-1, ret2=-1, temp=31, x={3:0}] [L58] CALL, EXPR rangesum(x) VAL [x={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=1, i=11, ret=2147483555, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=1, i=12, ret=2147483555, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=2147483555, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=2, i=12, ret=2147483573, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=2, i=13, ret=2147483573, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=2147483573, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=3, i=13, ret=2147483590, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=3, i=14, ret=2147483590, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=2147483590, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=4, i=14, ret=2147483601, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=4, i=15, ret=2147483601, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=2147483601, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=5, i=15, ret=4294967248, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=5, i=16, ret=4294967248, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=4294967248, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=6, i=16, ret=2147483602, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=6, i=17, ret=2147483602, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=2147483602, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=7, i=17, ret=-45, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=7, i=18, ret=-45, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=-45, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=8, i=18, ret=-31, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=8, i=19, ret=-31, x={3:0}, x={3:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-31, x={3:0}, x={3:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [cnt=9, i=19, ret=0, x={3:0}, x={3:0}] [L28] i++ VAL [cnt=9, i=20, ret=0, x={3:0}, x={3:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=0, x={3:0}, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=0, cnt=9, i=20, ret=0, x={3:0}, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [i=19, rangesum(x)=0, ret=-1, ret2=-1, temp=31, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [i=19, ret=-1, ret2=-1, ret5=0, temp=31, x={3:0}] [L61] reach_error() VAL [i=19, ret=-1, ret2=-1, ret5=0, temp=31, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 15, TraceHistogramMax: 60, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 1112 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 726 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 386 mSDtfsCounter, 330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2691 GetRequests, 2578 SyntacticMatches, 10 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=14, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 11 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1988 NumberOfCodeBlocks, 1499 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2765 ConstructedInterpolants, 0 QuantifiedInterpolants, 3236 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3284 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 33845/35285 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 23:43:56,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE