/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 18:48:58,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 18:48:58,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 18:48:58,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 18:48:58,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 18:48:58,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 18:48:58,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 18:48:58,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 18:48:58,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 18:48:58,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 18:48:58,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 18:48:58,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 18:48:58,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 18:48:58,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 18:48:58,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 18:48:58,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 18:48:58,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 18:48:58,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 18:48:58,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 18:48:58,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 18:48:58,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 18:48:58,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 18:48:58,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 18:48:58,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 18:48:58,838 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 18:48:58,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 18:48:58,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 18:48:58,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 18:48:58,840 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 18:48:58,841 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 18:48:58,841 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 18:48:58,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 18:48:58,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 18:48:58,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 18:48:58,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 18:48:58,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 18:48:58,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 18:48:58,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 18:48:58,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 18:48:58,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 18:48:58,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 18:48:58,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 18:48:58,875 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 18:48:58,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 18:48:58,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 18:48:58,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 18:48:58,877 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 18:48:58,878 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 18:48:58,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 18:48:58,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 18:48:58,878 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 18:48:58,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 18:48:58,879 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 18:48:58,880 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 18:48:58,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 18:48:58,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 18:48:58,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 18:48:58,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 18:48:58,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 18:48:58,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 18:48:58,881 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 18:48:58,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 18:48:58,883 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 18:48:58,883 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 [2023-04-01 18:48:59,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 18:48:59,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 18:48:59,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 18:48:59,109 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 18:48:59,111 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 18:48:59,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2023-04-01 18:49:00,336 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 18:49:00,524 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 18:49:00,525 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2023-04-01 18:49:00,530 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a5ea09f/712ba4f3eacd4dbcbc8b2ab74715fb80/FLAG91a005316 [2023-04-01 18:49:00,545 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12a5ea09f/712ba4f3eacd4dbcbc8b2ab74715fb80 [2023-04-01 18:49:00,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 18:49:00,549 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 18:49:00,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 18:49:00,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 18:49:00,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 18:49:00,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b63d1ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00, skipping insertion in model container [2023-04-01 18:49:00,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 18:49:00,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 18:49:00,712 WARN L247 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-04-01 18:49:00,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 18:49:00,732 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 18:49:00,754 WARN L247 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-04-01 18:49:00,755 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 18:49:00,766 INFO L208 MainTranslator]: Completed translation [2023-04-01 18:49:00,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00 WrapperNode [2023-04-01 18:49:00,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 18:49:00,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 18:49:00,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 18:49:00,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 18:49:00,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 18:49:00,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 18:49:00,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 18:49:00,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 18:49:00,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (1/1) ... [2023-04-01 18:49:00,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 18:49:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:00,840 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-04-01 18:49:00,848 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-04-01 18:49:00,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 18:49:00,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 18:49:00,874 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 18:49:00,875 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2023-04-01 18:49:00,875 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2023-04-01 18:49:00,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 18:49:00,875 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 18:49:00,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 18:49:00,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 18:49:00,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 18:49:00,875 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 18:49:00,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 18:49:00,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 18:49:00,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 18:49:00,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 18:49:00,972 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 18:49:00,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 18:49:01,147 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 18:49:01,152 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 18:49:01,153 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 18:49:01,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:49:01 BoogieIcfgContainer [2023-04-01 18:49:01,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 18:49:01,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 18:49:01,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 18:49:01,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 18:49:01,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 06:49:00" (1/3) ... [2023-04-01 18:49:01,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f592c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:49:01, skipping insertion in model container [2023-04-01 18:49:01,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:49:00" (2/3) ... [2023-04-01 18:49:01,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f592c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:49:01, skipping insertion in model container [2023-04-01 18:49:01,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:49:01" (3/3) ... [2023-04-01 18:49:01,162 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2023-04-01 18:49:01,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 18:49:01,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 18:49:01,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 18:49:01,226 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;@3f76fc62, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 18:49:01,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 18:49:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 18:49:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 18:49:01,239 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:01,239 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, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:01,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:01,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -310144342, now seen corresponding path program 1 times [2023-04-01 18:49:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185128401] [2023-04-01 18:49:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:01,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185128401] [2023-04-01 18:49:01,403 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-01 18:49:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530058148] [2023-04-01 18:49:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:01,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:01,407 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-04-01 18:49:01,408 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-04-01 18:49:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:01,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-01 18:49:01,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 18:49:01,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 18:49:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530058148] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 18:49:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 18:49:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 18:49:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737751792] [2023-04-01 18:49:01,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 18:49:01,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 18:49:01,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:01,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 18:49:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 18:49:01,630 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:01,647 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2023-04-01 18:49:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 18:49:01,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-04-01 18:49:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:01,656 INFO L225 Difference]: With dead ends: 64 [2023-04-01 18:49:01,656 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 18:49:01,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 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-04-01 18:49:01,661 INFO L413 NwaCegarLoop]: 43 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, 43 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-04-01 18:49:01,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 18:49:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-04-01 18:49:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-04-01 18:49:01,700 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2023-04-01 18:49:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:01,701 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-04-01 18:49:01,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-04-01 18:49:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 18:49:01,705 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:01,705 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, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:01,713 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-04-01 18:49:01,912 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-04-01 18:49:01,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:01,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash -173787228, now seen corresponding path program 1 times [2023-04-01 18:49:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:01,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396826473] [2023-04-01 18:49:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396826473] [2023-04-01 18:49:01,989 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-01 18:49:01,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248733860] [2023-04-01 18:49:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:01,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:02,000 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-04-01 18:49:02,002 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-04-01 18:49:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:02,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-01 18:49:02,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 18:49:02,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 18:49:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248733860] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 18:49:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 18:49:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 18:49:02,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806957030] [2023-04-01 18:49:02,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 18:49:02,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 18:49:02,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:02,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 18:49:02,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 18:49:02,113 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:02,131 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2023-04-01 18:49:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 18:49:02,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-04-01 18:49:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:02,136 INFO L225 Difference]: With dead ends: 56 [2023-04-01 18:49:02,136 INFO L226 Difference]: Without dead ends: 34 [2023-04-01 18:49:02,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-04-01 18:49:02,138 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 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-04-01 18:49:02,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-04-01 18:49:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-04-01 18:49:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-04-01 18:49:02,145 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2023-04-01 18:49:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:02,145 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-04-01 18:49:02,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-04-01 18:49:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 18:49:02,147 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:02,147 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:02,155 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-04-01 18:49:02,347 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-04-01 18:49:02,348 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:02,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -886074366, now seen corresponding path program 1 times [2023-04-01 18:49:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647069612] [2023-04-01 18:49:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:02,385 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561640960] [2023-04-01 18:49:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:02,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:02,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:02,392 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-04-01 18:49:02,395 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-04-01 18:49:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:02,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-01 18:49:02,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 18:49:02,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 18:49:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:02,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647069612] [2023-04-01 18:49:02,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:02,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561640960] [2023-04-01 18:49:02,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561640960] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 18:49:02,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 18:49:02,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 18:49:02,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000870996] [2023-04-01 18:49:02,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 18:49:02,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 18:49:02,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:02,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 18:49:02,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 18:49:02,518 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:02,542 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2023-04-01 18:49:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 18:49:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2023-04-01 18:49:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:02,548 INFO L225 Difference]: With dead ends: 54 [2023-04-01 18:49:02,548 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 18:49:02,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-04-01 18:49:02,549 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 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-04-01 18:49:02,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 18:49:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-04-01 18:49:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-04-01 18:49:02,555 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 39 [2023-04-01 18:49:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:02,556 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-04-01 18:49:02,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-04-01 18:49:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-04-01 18:49:02,561 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:02,561 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, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:02,566 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-04-01 18:49:02,765 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-04-01 18:49:02,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:02,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash 527335525, now seen corresponding path program 1 times [2023-04-01 18:49:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:02,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080267433] [2023-04-01 18:49:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:02,784 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:02,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [959422877] [2023-04-01 18:49:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:02,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:02,795 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-04-01 18:49:02,797 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-04-01 18:49:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:02,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2023-04-01 18:49:02,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 18:49:02,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 18:49:02,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080267433] [2023-04-01 18:49:02,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:02,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959422877] [2023-04-01 18:49:02,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959422877] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 18:49:02,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 18:49:02,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 18:49:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463925354] [2023-04-01 18:49:02,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 18:49:02,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 18:49:02,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 18:49:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 18:49:02,909 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:02,926 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2023-04-01 18:49:02,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 18:49:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-04-01 18:49:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:02,929 INFO L225 Difference]: With dead ends: 52 [2023-04-01 18:49:02,930 INFO L226 Difference]: Without dead ends: 37 [2023-04-01 18:49:02,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-04-01 18:49:02,936 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 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-04-01 18:49:02,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-01 18:49:02,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2023-04-01 18:49:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-04-01 18:49:02,942 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 48 [2023-04-01 18:49:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:02,943 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-04-01 18:49:02,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-04-01 18:49:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-01 18:49:02,944 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:02,945 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:02,952 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-04-01 18:49:03,150 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-04-01 18:49:03,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:03,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:03,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1044403897, now seen corresponding path program 1 times [2023-04-01 18:49:03,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:03,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78776247] [2023-04-01 18:49:03,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:03,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:03,184 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716954819] [2023-04-01 18:49:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:03,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:03,194 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-04-01 18:49:03,195 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-04-01 18:49:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 18:49:03,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-04-01 18:49:03,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 18:49:03,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:03,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78776247] [2023-04-01 18:49:03,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:03,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716954819] [2023-04-01 18:49:03,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716954819] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 18:49:03,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 18:49:03,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 18:49:03,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003125737] [2023-04-01 18:49:03,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 18:49:03,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 18:49:03,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 18:49:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 18:49:03,298 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:03,317 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2023-04-01 18:49:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 18:49:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-04-01 18:49:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:03,322 INFO L225 Difference]: With dead ends: 63 [2023-04-01 18:49:03,322 INFO L226 Difference]: Without dead ends: 42 [2023-04-01 18:49:03,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-04-01 18:49:03,327 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 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-04-01 18:49:03,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-01 18:49:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-04-01 18:49:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-04-01 18:49:03,334 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 50 [2023-04-01 18:49:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:03,334 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-04-01 18:49:03,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 18:49:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2023-04-01 18:49:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-04-01 18:49:03,336 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:03,336 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:03,347 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-04-01 18:49:03,541 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-04-01 18:49:03,542 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:03,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1413282844, now seen corresponding path program 1 times [2023-04-01 18:49:03,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:03,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922487316] [2023-04-01 18:49:03,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 18:49:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-01 18:49:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-04-01 18:49:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-04-01 18:49:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-04-01 18:49:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 18:49:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922487316] [2023-04-01 18:49:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922487316] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 18:49:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885732900] [2023-04-01 18:49:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:03,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:03,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:03,779 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-04-01 18:49:03,784 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-04-01 18:49:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:03,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 18:49:03,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:03,889 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-04-01 18:49:03,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-04-01 18:49:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885732900] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:03,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 18:49:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2023-04-01 18:49:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850753976] [2023-04-01 18:49:03,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:03,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 18:49:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 18:49:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-04-01 18:49:03,939 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-04-01 18:49:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:04,160 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2023-04-01 18:49:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 18:49:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2023-04-01 18:49:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:04,164 INFO L225 Difference]: With dead ends: 79 [2023-04-01 18:49:04,164 INFO L226 Difference]: Without dead ends: 50 [2023-04-01 18:49:04,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-04-01 18:49:04,169 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:04,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 7 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 18:49:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-04-01 18:49:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-04-01 18:49:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-04-01 18:49:04,188 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 50 [2023-04-01 18:49:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:04,188 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-04-01 18:49:04,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-04-01 18:49:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-04-01 18:49:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-04-01 18:49:04,190 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:04,190 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:04,198 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-04-01 18:49:04,390 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-04-01 18:49:04,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:04,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1142374631, now seen corresponding path program 2 times [2023-04-01 18:49:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901602330] [2023-04-01 18:49:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:04,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 18:49:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-04-01 18:49:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:04,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-04-01 18:49:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-04-01 18:49:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-04-01 18:49:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-04-01 18:49:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901602330] [2023-04-01 18:49:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901602330] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 18:49:04,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604201715] [2023-04-01 18:49:04,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 18:49:04,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:04,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:04,572 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-04-01 18:49:04,603 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-04-01 18:49:04,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 18:49:04,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 18:49:04,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 18:49:04,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-04-01 18:49:04,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-04-01 18:49:04,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604201715] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:04,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 18:49:04,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2023-04-01 18:49:04,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374740106] [2023-04-01 18:49:04,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 18:49:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 18:49:04,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2023-04-01 18:49:04,836 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-01 18:49:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:05,127 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2023-04-01 18:49:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 18:49:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 65 [2023-04-01 18:49:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:05,128 INFO L225 Difference]: With dead ends: 96 [2023-04-01 18:49:05,128 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 18:49:05,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2023-04-01 18:49:05,129 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:05,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 11 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 18:49:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 18:49:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2023-04-01 18:49:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-04-01 18:49:05,138 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 65 [2023-04-01 18:49:05,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:05,138 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-04-01 18:49:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-04-01 18:49:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-04-01 18:49:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-04-01 18:49:05,140 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:05,140 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:05,154 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-04-01 18:49:05,346 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-04-01 18:49:05,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:05,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1692207533, now seen corresponding path program 1 times [2023-04-01 18:49:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:05,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283820553] [2023-04-01 18:49:05,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:05,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:05,370 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077516988] [2023-04-01 18:49:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:05,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:05,372 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-04-01 18:49:05,376 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-04-01 18:49:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:05,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 18:49:05,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-04-01 18:49:05,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-04-01 18:49:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283820553] [2023-04-01 18:49:05,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077516988] [2023-04-01 18:49:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077516988] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:05,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2023-04-01 18:49:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862028274] [2023-04-01 18:49:05,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:05,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-01 18:49:05,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:05,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-01 18:49:05,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2023-04-01 18:49:05,773 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-04-01 18:49:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:05,833 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2023-04-01 18:49:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 18:49:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2023-04-01 18:49:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:05,834 INFO L225 Difference]: With dead ends: 109 [2023-04-01 18:49:05,834 INFO L226 Difference]: Without dead ends: 79 [2023-04-01 18:49:05,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 149 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-04-01 18:49:05,836 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:05,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-04-01 18:49:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-04-01 18:49:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2023-04-01 18:49:05,845 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 86 [2023-04-01 18:49:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:05,845 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2023-04-01 18:49:05,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.272727272727273) internal successors, (72), 22 states have internal predecessors, (72), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-04-01 18:49:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2023-04-01 18:49:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-04-01 18:49:05,847 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:05,847 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:05,855 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-04-01 18:49:06,053 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-04-01 18:49:06,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:06,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1327222361, now seen corresponding path program 2 times [2023-04-01 18:49:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:06,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266293540] [2023-04-01 18:49:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:06,081 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857292681] [2023-04-01 18:49:06,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 18:49:06,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:06,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:06,083 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-04-01 18:49:06,086 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-04-01 18:49:06,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 18:49:06,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 18:49:06,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 18:49:06,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:06,236 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2023-04-01 18:49:06,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-04-01 18:49:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266293540] [2023-04-01 18:49:06,276 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857292681] [2023-04-01 18:49:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857292681] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:06,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-01 18:49:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923818713] [2023-04-01 18:49:06,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:06,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 18:49:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 18:49:06,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-04-01 18:49:06,278 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 18:49:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:06,305 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2023-04-01 18:49:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 18:49:06,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2023-04-01 18:49:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:06,306 INFO L225 Difference]: With dead ends: 117 [2023-04-01 18:49:06,306 INFO L226 Difference]: Without dead ends: 91 [2023-04-01 18:49:06,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 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-04-01 18:49:06,307 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:06,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-04-01 18:49:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-04-01 18:49:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-04-01 18:49:06,322 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 106 [2023-04-01 18:49:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:06,322 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-04-01 18:49:06,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 18:49:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-04-01 18:49:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-04-01 18:49:06,324 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:06,324 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:06,334 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-04-01 18:49:06,534 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-04-01 18:49:06,534 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:06,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1147785241, now seen corresponding path program 3 times [2023-04-01 18:49:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:06,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512881621] [2023-04-01 18:49:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:06,564 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094611950] [2023-04-01 18:49:06,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 18:49:06,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:06,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:06,565 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-04-01 18:49:06,568 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-04-01 18:49:06,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 18:49:06,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 18:49:06,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 18:49:06,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 332 proven. 1 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2023-04-01 18:49:06,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2023-04-01 18:49:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512881621] [2023-04-01 18:49:06,755 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094611950] [2023-04-01 18:49:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094611950] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:06,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:06,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-04-01 18:49:06,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852138739] [2023-04-01 18:49:06,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:06,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 18:49:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 18:49:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-04-01 18:49:06,757 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 18:49:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:06,773 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2023-04-01 18:49:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 18:49:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 142 [2023-04-01 18:49:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:06,775 INFO L225 Difference]: With dead ends: 129 [2023-04-01 18:49:06,775 INFO L226 Difference]: Without dead ends: 97 [2023-04-01 18:49:06,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 279 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-04-01 18:49:06,775 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 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-04-01 18:49:06,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-04-01 18:49:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-04-01 18:49:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-04-01 18:49:06,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 142 [2023-04-01 18:49:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:06,785 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-04-01 18:49:06,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 18:49:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-04-01 18:49:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-04-01 18:49:06,787 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:06,787 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:06,795 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-04-01 18:49:06,992 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-04-01 18:49:06,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:06,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash -204017523, now seen corresponding path program 4 times [2023-04-01 18:49:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307477604] [2023-04-01 18:49:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:07,030 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:07,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721504263] [2023-04-01 18:49:07,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 18:49:07,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:07,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:07,032 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-04-01 18:49:07,034 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-04-01 18:49:07,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 18:49:07,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 18:49:07,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 18:49:07,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 309 proven. 57 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2023-04-01 18:49:07,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2023-04-01 18:49:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307477604] [2023-04-01 18:49:07,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721504263] [2023-04-01 18:49:07,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721504263] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:07,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:07,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2023-04-01 18:49:07,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355470104] [2023-04-01 18:49:07,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:07,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 18:49:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:07,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 18:49:07,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-04-01 18:49:07,304 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 18:49:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:07,353 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2023-04-01 18:49:07,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 18:49:07,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2023-04-01 18:49:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:07,355 INFO L225 Difference]: With dead ends: 156 [2023-04-01 18:49:07,355 INFO L226 Difference]: Without dead ends: 112 [2023-04-01 18:49:07,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 281 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-04-01 18:49:07,356 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:07,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-04-01 18:49:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-04-01 18:49:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 102 states have (on average 1.0490196078431373) internal successors, (107), 102 states have internal predecessors, (107), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:07,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2023-04-01 18:49:07,364 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 148 [2023-04-01 18:49:07,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:07,365 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2023-04-01 18:49:07,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 18:49:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2023-04-01 18:49:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-04-01 18:49:07,367 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:07,367 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:07,375 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-04-01 18:49:07,572 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-04-01 18:49:07,573 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:07,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1375832974, now seen corresponding path program 5 times [2023-04-01 18:49:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948184907] [2023-04-01 18:49:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:07,601 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:07,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [909152932] [2023-04-01 18:49:07,602 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-04-01 18:49:07,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:07,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:07,603 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-04-01 18:49:07,606 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-04-01 18:49:07,706 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-04-01 18:49:07,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 18:49:07,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-01 18:49:07,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 1023 proven. 26 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2023-04-01 18:49:07,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2429 backedges. 107 proven. 378 refuted. 0 times theorem prover too weak. 1944 trivial. 0 not checked. [2023-04-01 18:49:07,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:07,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948184907] [2023-04-01 18:49:07,837 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:07,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909152932] [2023-04-01 18:49:07,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909152932] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:07,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:07,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-04-01 18:49:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797352748] [2023-04-01 18:49:07,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:07,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 18:49:07,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 18:49:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-04-01 18:49:07,839 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 18:49:07,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:07,880 INFO L93 Difference]: Finished difference Result 195 states and 224 transitions. [2023-04-01 18:49:07,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 18:49:07,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 193 [2023-04-01 18:49:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:07,881 INFO L225 Difference]: With dead ends: 195 [2023-04-01 18:49:07,881 INFO L226 Difference]: Without dead ends: 136 [2023-04-01 18:49:07,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 373 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-04-01 18:49:07,882 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:07,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 194 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:07,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-04-01 18:49:07,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-04-01 18:49:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 126 states have (on average 1.1031746031746033) internal successors, (139), 126 states have internal predecessors, (139), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2023-04-01 18:49:07,892 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 193 [2023-04-01 18:49:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:07,892 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2023-04-01 18:49:07,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 18:49:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2023-04-01 18:49:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-04-01 18:49:07,895 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:07,895 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:07,902 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-04-01 18:49:08,100 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-04-01 18:49:08,100 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:08,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash -949747470, now seen corresponding path program 6 times [2023-04-01 18:49:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680934910] [2023-04-01 18:49:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:08,132 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302740535] [2023-04-01 18:49:08,132 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-04-01 18:49:08,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:08,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:08,133 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-04-01 18:49:08,136 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-04-01 18:49:08,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2023-04-01 18:49:08,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 18:49:08,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 18:49:08,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5921 backedges. 2490 proven. 16 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2023-04-01 18:49:08,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5921 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2023-04-01 18:49:08,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680934910] [2023-04-01 18:49:08,623 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302740535] [2023-04-01 18:49:08,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302740535] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:08,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:08,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-04-01 18:49:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427842383] [2023-04-01 18:49:08,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:08,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 18:49:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 18:49:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-04-01 18:49:08,625 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 18:49:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:08,656 INFO L93 Difference]: Finished difference Result 219 states and 249 transitions. [2023-04-01 18:49:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 18:49:08,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 265 [2023-04-01 18:49:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:08,658 INFO L225 Difference]: With dead ends: 219 [2023-04-01 18:49:08,658 INFO L226 Difference]: Without dead ends: 148 [2023-04-01 18:49:08,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 519 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-04-01 18:49:08,659 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 138 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-04-01 18:49:08,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 138 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-04-01 18:49:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-04-01 18:49:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 138 states have (on average 1.0942028985507246) internal successors, (151), 138 states have internal predecessors, (151), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2023-04-01 18:49:08,670 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 265 [2023-04-01 18:49:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:08,671 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2023-04-01 18:49:08,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 18:49:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2023-04-01 18:49:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2023-04-01 18:49:08,674 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:08,674 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:08,684 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-04-01 18:49:08,880 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-04-01 18:49:08,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:08,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1607020710, now seen corresponding path program 7 times [2023-04-01 18:49:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:08,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109176466] [2023-04-01 18:49:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:08,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:08,918 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [184990352] [2023-04-01 18:49:08,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 18:49:08,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:08,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:08,920 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-04-01 18:49:08,944 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-04-01 18:49:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 18:49:09,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 18:49:09,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 18:49:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 2490 proven. 100 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2023-04-01 18:49:09,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 18:49:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2023-04-01 18:49:09,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 18:49:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109176466] [2023-04-01 18:49:09,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-01 18:49:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184990352] [2023-04-01 18:49:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184990352] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 18:49:09,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 18:49:09,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-04-01 18:49:09,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765417424] [2023-04-01 18:49:09,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 18:49:09,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 18:49:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 18:49:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 18:49:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2023-04-01 18:49:09,423 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 18:49:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 18:49:09,477 INFO L93 Difference]: Finished difference Result 237 states and 270 transitions. [2023-04-01 18:49:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-04-01 18:49:09,477 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 277 [2023-04-01 18:49:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 18:49:09,478 INFO L225 Difference]: With dead ends: 237 [2023-04-01 18:49:09,478 INFO L226 Difference]: Without dead ends: 166 [2023-04-01 18:49:09,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 531 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-04-01 18:49:09,480 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 18:49:09,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 18:49:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-04-01 18:49:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-04-01 18:49:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 156 states have (on average 1.0833333333333333) internal successors, (169), 156 states have internal predecessors, (169), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 18:49:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2023-04-01 18:49:09,489 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 277 [2023-04-01 18:49:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 18:49:09,489 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2023-04-01 18:49:09,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 21 states have internal predecessors, (70), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-04-01 18:49:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2023-04-01 18:49:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-04-01 18:49:09,493 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 18:49:09,493 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 18:49:09,500 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-04-01 18:49:09,699 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-04-01 18:49:09,700 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 18:49:09,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 18:49:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1649043956, now seen corresponding path program 8 times [2023-04-01 18:49:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 18:49:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907634452] [2023-04-01 18:49:09,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 18:49:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 18:49:09,738 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-01 18:49:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [891743053] [2023-04-01 18:49:09,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-01 18:49:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 18:49:09,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 18:49:09,740 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-04-01 18:49:09,743 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-04-01 18:49:13,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-01 18:49:13,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-01 18:49:13,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 18:49:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 18:49:17,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 18:49:17,914 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 18:49:17,914 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 18:49:17,937 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-04-01 18:49:18,130 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-04-01 18:49:18,133 INFO L445 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1, 1] [2023-04-01 18:49:18,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 18:49:18,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 06:49:18 BoogieIcfgContainer [2023-04-01 18:49:18,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 18:49:18,260 INFO L158 Benchmark]: Toolchain (without parser) took 17710.58ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 216.0MB in the beginning and 277.0MB in the end (delta: -61.0MB). Peak memory consumption was 168.8MB. Max. memory is 8.0GB. [2023-04-01 18:49:18,260 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 18:49:18,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.47ms. Allocated memory is still 261.1MB. Free memory was 216.0MB in the beginning and 205.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-01 18:49:18,260 INFO L158 Benchmark]: Boogie Preprocessor took 43.54ms. Allocated memory is still 261.1MB. Free memory was 205.3MB in the beginning and 203.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 18:49:18,260 INFO L158 Benchmark]: RCFGBuilder took 342.56ms. Allocated memory is still 261.1MB. Free memory was 203.4MB in the beginning and 190.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-04-01 18:49:18,261 INFO L158 Benchmark]: TraceAbstraction took 17102.75ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 189.7MB in the beginning and 277.0MB in the end (delta: -87.2MB). Peak memory consumption was 142.6MB. Max. memory is 8.0GB. [2023-04-01 18:49:18,262 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.47ms. Allocated memory is still 261.1MB. Free memory was 216.0MB in the beginning and 205.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.54ms. Allocated memory is still 261.1MB. Free memory was 205.3MB in the beginning and 203.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 342.56ms. Allocated memory is still 261.1MB. Free memory was 203.4MB in the beginning and 190.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17102.75ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 189.7MB in the beginning and 277.0MB in the end (delta: -87.2MB). Peak memory consumption was 142.6MB. Max. memory is 8.0GB. * 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]; VAL [x={6:0}] [L43] CALL init_nondet(x) VAL [x={6:0}] [L16] int i; [L17] i = 0 VAL [i=0, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={6:0}, x={6:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={6:0}, x={6:0}] [L17] COND FALSE !(i < 20) VAL [i=20, x={6:0}, x={6:0}] [L43] RET init_nondet(x) VAL [x={6:0}] [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={6:0}] [L49] CALL, EXPR rangesum(x) VAL [x={6: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={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={6:0}, x={6: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=-2, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=1, i=12, ret=-2, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=-2, x={6:0}, x={6: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=-5, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=2, i=13, ret=-5, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=-5, x={6:0}, x={6: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=-7, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=3, i=14, ret=-7, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=-7, x={6:0}, x={6: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=-8, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=4, i=15, ret=-8, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=-8, x={6:0}, x={6: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=-4, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=5, i=16, ret=-4, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=-4, x={6:0}, x={6: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=1, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=6, i=17, ret=1, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=1, x={6:0}, x={6: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=-54, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=7, i=18, ret=-54, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=-54, x={6:0}, x={6: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=-25, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=8, i=19, ret=-25, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-25, x={6:0}, x={6: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=-19, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=9, i=20, ret=-19, x={6:0}, x={6:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-19, x={6:0}, x={6:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-2, cnt=9, i=20, ret=-19, x={6:0}, x={6:0}] [L49] RET, EXPR rangesum(x) VAL [rangesum(x)=-2, x={6: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=-2, temp=33, x={6:0}] [L52] CALL, EXPR rangesum(x) VAL [x={6: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={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={6:0}, x={6: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=-2, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=1, i=12, ret=-2, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=-2, x={6:0}, x={6: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=-5, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=2, i=13, ret=-5, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=-5, x={6:0}, x={6: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=-7, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=3, i=14, ret=-7, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=-7, x={6:0}, x={6: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=-8, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=4, i=15, ret=-8, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=-8, x={6:0}, x={6: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=-4, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=5, i=16, ret=-4, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=-4, x={6:0}, x={6: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=1, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=6, i=17, ret=1, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=1, x={6:0}, x={6: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=-54, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=7, i=18, ret=-54, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=-54, x={6:0}, x={6: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=-25, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=8, i=19, ret=-25, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-25, x={6:0}, x={6: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=-19, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=9, i=20, ret=-19, x={6:0}, x={6:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-19, x={6:0}, x={6:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-2, cnt=9, i=20, ret=-19, x={6:0}, x={6:0}] [L52] RET, EXPR rangesum(x) VAL [rangesum(x)=-2, ret=-2, temp=33, x={6:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=-2, ret=-2, temp=8, x={6:0}] [L54] COND FALSE !(i<20 -1) VAL [i=19, ret2=-2, ret=-2, temp=8, x={6:0}] [L57] x[20 -1] = temp VAL [i=19, ret2=-2, ret=-2, temp=8, x={6:0}] [L58] CALL, EXPR rangesum(x) VAL [x={6: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={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=0, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=0, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=1, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=2, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=3, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=4, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=5, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=6, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=7, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=8, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=9, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L29] COND FALSE !(i > 20/2) VAL [cnt=0, i=10, ret=0, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=0, i=11, ret=0, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=0, i=11, ret=0, x={6:0}, x={6: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=-3, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=1, i=12, ret=-3, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=1, i=12, ret=-3, x={6:0}, x={6: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=-5, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=2, i=13, ret=-5, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=2, i=13, ret=-5, x={6:0}, x={6: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=-6, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=3, i=14, ret=-6, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=3, i=14, ret=-6, x={6:0}, x={6: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=-2, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=4, i=15, ret=-2, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=4, i=15, ret=-2, x={6:0}, x={6: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=3, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=5, i=16, ret=3, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=5, i=16, ret=3, x={6:0}, x={6: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=-52, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=6, i=17, ret=-52, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=6, i=17, ret=-52, x={6:0}, x={6: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=-23, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=7, i=18, ret=-23, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=7, i=18, ret=-23, x={6:0}, x={6: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=-17, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=8, i=19, ret=-17, x={6:0}, x={6:0}] [L28] COND TRUE i < 20 VAL [cnt=8, i=19, ret=-17, x={6:0}, x={6: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=-9, x={6:0}, x={6:0}] [L28] i++ VAL [cnt=9, i=20, ret=-9, x={6:0}, x={6:0}] [L28] COND FALSE !(i < 20) VAL [cnt=9, i=20, ret=-9, x={6:0}, x={6:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\result=-1, cnt=9, i=20, ret=-9, x={6:0}, x={6:0}] [L58] RET, EXPR rangesum(x) VAL [i=19, rangesum(x)=-1, ret2=-2, ret=-2, temp=8, x={6:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [i=19, ret2=-2, ret5=-1, ret=-2, temp=8, x={6:0}] [L61] reach_error() VAL [i=19, ret2=-2, ret5=-1, ret=-2, temp=8, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 15, TraceHistogramMax: 60, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 1280 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 840 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 440 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2917 GetRequests, 2779 SyntacticMatches, 10 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=14, InterpolantAutomatonStates: 138, 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, 4.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2027 NumberOfCodeBlocks, 1530 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2965 ConstructedInterpolants, 0 QuantifiedInterpolants, 3447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3580 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 33854/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-04-01 18:49:18,278 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...