./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 16:28:48,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 16:28:48,651 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-12-02 16:28:48,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 16:28:48,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 16:28:48,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 16:28:48,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 16:28:48,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 16:28:48,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 16:28:48,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 16:28:48,683 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 16:28:48,684 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 16:28:48,684 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 16:28:48,685 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 16:28:48,685 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 16:28:48,686 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 16:28:48,686 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 16:28:48,687 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 16:28:48,687 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 16:28:48,688 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 16:28:48,688 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 16:28:48,689 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 16:28:48,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 16:28:48,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 16:28:48,690 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 16:28:48,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 16:28:48,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 16:28:48,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 16:28:48,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 16:28:48,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 16:28:48,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 16:28:48,693 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 16:28:48,693 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 16:28:48,693 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 16:28:48,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 16:28:48,693 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 16:28:48,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 16:28:48,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 16:28:48,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 16:28:48,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:28:48,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 16:28:48,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 16:28:48,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 16:28:48,695 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 16:28:48,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 16:28:48,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 16:28:48,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 16:28:48,696 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 16:28:48,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 16:28:48,697 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2023-12-02 16:28:48,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 16:28:48,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 16:28:48,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 16:28:48,941 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 16:28:48,941 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 16:28:48,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-12-02 16:28:51,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 16:28:51,855 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 16:28:51,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-12-02 16:28:51,864 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/data/e3c000f4d/539caaef5d734290bbf3cadf9c72a40d/FLAGaa36e75b4 [2023-12-02 16:28:51,877 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/data/e3c000f4d/539caaef5d734290bbf3cadf9c72a40d [2023-12-02 16:28:51,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 16:28:51,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 16:28:51,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 16:28:51,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 16:28:51,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 16:28:51,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:28:51" (1/1) ... [2023-12-02 16:28:51,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2933ba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:51, skipping insertion in model container [2023-12-02 16:28:51,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:28:51" (1/1) ... [2023-12-02 16:28:51,913 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 16:28:52,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:28:52,094 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 16:28:52,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 16:28:52,132 INFO L206 MainTranslator]: Completed translation [2023-12-02 16:28:52,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52 WrapperNode [2023-12-02 16:28:52,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 16:28:52,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 16:28:52,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 16:28:52,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 16:28:52,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,172 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2023-12-02 16:28:52,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 16:28:52,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 16:28:52,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 16:28:52,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 16:28:52,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 16:28:52,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 16:28:52,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 16:28:52,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 16:28:52,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (1/1) ... [2023-12-02 16:28:52,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 16:28:52,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:28:52,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 16:28:52,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 16:28:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 16:28:52,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 16:28:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 16:28:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 16:28:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 16:28:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 16:28:52,336 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 16:28:52,338 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 16:28:52,594 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 16:28:52,626 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 16:28:52,627 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 16:28:52,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:28:52 BoogieIcfgContainer [2023-12-02 16:28:52,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 16:28:52,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 16:28:52,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 16:28:52,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 16:28:52,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:28:51" (1/3) ... [2023-12-02 16:28:52,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b88c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:28:52, skipping insertion in model container [2023-12-02 16:28:52,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:28:52" (2/3) ... [2023-12-02 16:28:52,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b88c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:28:52, skipping insertion in model container [2023-12-02 16:28:52,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:28:52" (3/3) ... [2023-12-02 16:28:52,638 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-12-02 16:28:52,658 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 16:28:52,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-12-02 16:28:52,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 16:28:52,705 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@481c363b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 16:28:52,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-12-02 16:28:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 86 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 16:28:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 16:28:52,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:52,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:52,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:52,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015777, now seen corresponding path program 1 times [2023-12-02 16:28:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:52,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189499458] [2023-12-02 16:28:52,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:52,917 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189499458] [2023-12-02 16:28:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189499458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:52,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:52,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:28:52,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732578527] [2023-12-02 16:28:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:52,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:28:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:52,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:28:52,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:52,961 INFO L87 Difference]: Start difference. First operand has 103 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 86 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:53,049 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2023-12-02 16:28:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:28:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 16:28:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:53,057 INFO L225 Difference]: With dead ends: 165 [2023-12-02 16:28:53,057 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 16:28:53,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 16:28:53,063 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:53,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 122 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 16:28:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 16:28:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.588235294117647) internal successors, (81), 78 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 16:28:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2023-12-02 16:28:53,108 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 9 [2023-12-02 16:28:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:53,108 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2023-12-02 16:28:53,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2023-12-02 16:28:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 16:28:53,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:53,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:53,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 16:28:53,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:53,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1005883126, now seen corresponding path program 1 times [2023-12-02 16:28:53,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192649329] [2023-12-02 16:28:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:53,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:53,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192649329] [2023-12-02 16:28:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192649329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:53,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:28:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893061793] [2023-12-02 16:28:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:53,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:28:53,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:53,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:28:53,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:53,155 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:53,186 INFO L93 Difference]: Finished difference Result 179 states and 222 transitions. [2023-12-02 16:28:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:28:53,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 16:28:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:53,189 INFO L225 Difference]: With dead ends: 179 [2023-12-02 16:28:53,189 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 16:28:53,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:53,192 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:53,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 16:28:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 16:28:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 78 states have internal predecessors, (80), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 16:28:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2023-12-02 16:28:53,212 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 10 [2023-12-02 16:28:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:53,212 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2023-12-02 16:28:53,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2023-12-02 16:28:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 16:28:53,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:53,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:53,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 16:28:53,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:53,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1005881460, now seen corresponding path program 1 times [2023-12-02 16:28:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681231363] [2023-12-02 16:28:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:53,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:53,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681231363] [2023-12-02 16:28:53,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681231363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:53,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:53,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 16:28:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002786330] [2023-12-02 16:28:53,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:53,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:28:53,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:53,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:28:53,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:53,261 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:53,304 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2023-12-02 16:28:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:28:53,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 16:28:53,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:53,306 INFO L225 Difference]: With dead ends: 95 [2023-12-02 16:28:53,306 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 16:28:53,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-02 16:28:53,308 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:53,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 110 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 16:28:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 16:28:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 73 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 16:28:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2023-12-02 16:28:53,325 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 10 [2023-12-02 16:28:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:53,326 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2023-12-02 16:28:53,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2023-12-02 16:28:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 16:28:53,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:53,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:53,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 16:28:53,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:53,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -284438866, now seen corresponding path program 1 times [2023-12-02 16:28:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005389839] [2023-12-02 16:28:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:53,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005389839] [2023-12-02 16:28:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005389839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:53,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:28:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417365182] [2023-12-02 16:28:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:53,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:28:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:28:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:28:53,381 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:53,519 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2023-12-02 16:28:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:28:53,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 16:28:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:53,521 INFO L225 Difference]: With dead ends: 90 [2023-12-02 16:28:53,521 INFO L226 Difference]: Without dead ends: 82 [2023-12-02 16:28:53,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:28:53,523 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 107 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:53,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 116 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:28:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-02 16:28:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-02 16:28:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 65 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 16:28:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 103 transitions. [2023-12-02 16:28:53,538 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 103 transitions. Word has length 12 [2023-12-02 16:28:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:53,538 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 103 transitions. [2023-12-02 16:28:53,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 103 transitions. [2023-12-02 16:28:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 16:28:53,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:53,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:53,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 16:28:53,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:53,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -227670169, now seen corresponding path program 1 times [2023-12-02 16:28:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:53,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926819939] [2023-12-02 16:28:53,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 16:28:53,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926819939] [2023-12-02 16:28:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926819939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:28:53,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675800858] [2023-12-02 16:28:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:53,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:28:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:28:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 16:28:53,590 INFO L87 Difference]: Start difference. First operand 82 states and 103 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:53,692 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2023-12-02 16:28:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:28:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 16:28:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:53,694 INFO L225 Difference]: With dead ends: 113 [2023-12-02 16:28:53,694 INFO L226 Difference]: Without dead ends: 106 [2023-12-02 16:28:53,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:28:53,696 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 79 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:53,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 189 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 16:28:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-02 16:28:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-12-02 16:28:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 82 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-02 16:28:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 135 transitions. [2023-12-02 16:28:53,716 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 135 transitions. Word has length 13 [2023-12-02 16:28:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:53,717 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 135 transitions. [2023-12-02 16:28:53,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:28:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2023-12-02 16:28:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 16:28:53,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:53,720 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:53,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 16:28:53,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:53,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash -206142774, now seen corresponding path program 1 times [2023-12-02 16:28:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936958180] [2023-12-02 16:28:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 16:28:53,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936958180] [2023-12-02 16:28:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936958180] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:28:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920689583] [2023-12-02 16:28:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:28:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:28:53,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:28:53,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 16:28:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:54,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 16:28:54,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:28:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 16:28:54,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:28:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 16:28:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920689583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:28:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1837232915] [2023-12-02 16:28:54,234 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2023-12-02 16:28:54,235 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:28:54,238 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:28:54,243 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:28:54,244 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:28:55,924 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2023-12-02 16:28:55,926 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:28:57,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1837232915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:57,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:28:57,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 4, 4] total 27 [2023-12-02 16:28:57,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819804533] [2023-12-02 16:28:57,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:57,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 16:28:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:57,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 16:28:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2023-12-02 16:28:57,398 INFO L87 Difference]: Start difference. First operand 106 states and 135 transitions. Second operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 16:28:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:58,870 INFO L93 Difference]: Finished difference Result 160 states and 216 transitions. [2023-12-02 16:28:58,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 16:28:58,871 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2023-12-02 16:28:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:58,873 INFO L225 Difference]: With dead ends: 160 [2023-12-02 16:28:58,873 INFO L226 Difference]: Without dead ends: 152 [2023-12-02 16:28:58,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=344, Invalid=778, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 16:28:58,876 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 478 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:58,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 140 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 16:28:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-02 16:28:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2023-12-02 16:28:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.2) internal successors, (90), 81 states have internal predecessors, (90), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-02 16:28:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2023-12-02 16:28:58,905 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 53 [2023-12-02 16:28:58,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:58,905 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 150 transitions. [2023-12-02 16:28:58,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 16:28:58,906 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2023-12-02 16:28:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-02 16:28:58,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:58,909 INFO L195 NwaCegarLoop]: trace histogram [12, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:58,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 16:28:59,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:28:59,116 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:59,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash -73909889, now seen corresponding path program 1 times [2023-12-02 16:28:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127786247] [2023-12-02 16:28:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:59,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-02 16:28:59,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:59,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127786247] [2023-12-02 16:28:59,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127786247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:59,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:59,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:28:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986267591] [2023-12-02 16:28:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:59,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:28:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:59,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:28:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:59,179 INFO L87 Difference]: Start difference. First operand 109 states and 150 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 16:28:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:59,252 INFO L93 Difference]: Finished difference Result 189 states and 263 transitions. [2023-12-02 16:28:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:28:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 78 [2023-12-02 16:28:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:59,254 INFO L225 Difference]: With dead ends: 189 [2023-12-02 16:28:59,254 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 16:28:59,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:59,255 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:59,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 16:28:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-02 16:28:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 81 states have internal predecessors, (89), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-02 16:28:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2023-12-02 16:28:59,281 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 149 transitions. Word has length 78 [2023-12-02 16:28:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:59,282 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 149 transitions. [2023-12-02 16:28:59,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-02 16:28:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2023-12-02 16:28:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-02 16:28:59,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:59,284 INFO L195 NwaCegarLoop]: trace histogram [12, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:59,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 16:28:59,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:59,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash -780292742, now seen corresponding path program 1 times [2023-12-02 16:28:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768663811] [2023-12-02 16:28:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-02 16:28:59,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768663811] [2023-12-02 16:28:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768663811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:59,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:59,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 16:28:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372111468] [2023-12-02 16:28:59,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:59,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:28:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:59,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:28:59,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:59,348 INFO L87 Difference]: Start difference. First operand 109 states and 149 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 16:28:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:59,378 INFO L93 Difference]: Finished difference Result 165 states and 231 transitions. [2023-12-02 16:28:59,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:28:59,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2023-12-02 16:28:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:59,381 INFO L225 Difference]: With dead ends: 165 [2023-12-02 16:28:59,381 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 16:28:59,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:59,382 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:59,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 16:28:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-02 16:28:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 81 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-02 16:28:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 146 transitions. [2023-12-02 16:28:59,409 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 146 transitions. Word has length 79 [2023-12-02 16:28:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:59,409 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 146 transitions. [2023-12-02 16:28:59,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 16:28:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2023-12-02 16:28:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 16:28:59,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:59,412 INFO L195 NwaCegarLoop]: trace histogram [12, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:59,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 16:28:59,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:59,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1508577226, now seen corresponding path program 1 times [2023-12-02 16:28:59,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:59,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663276199] [2023-12-02 16:28:59,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:59,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-02 16:28:59,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:59,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663276199] [2023-12-02 16:28:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663276199] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 16:28:59,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 16:28:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535422360] [2023-12-02 16:28:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 16:28:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 16:28:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 16:28:59,499 INFO L87 Difference]: Start difference. First operand 109 states and 146 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 16:28:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:59,538 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2023-12-02 16:28:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 16:28:59,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2023-12-02 16:28:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:59,540 INFO L225 Difference]: With dead ends: 142 [2023-12-02 16:28:59,541 INFO L226 Difference]: Without dead ends: 140 [2023-12-02 16:28:59,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-02 16:28:59,542 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:59,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 167 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-02 16:28:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2023-12-02 16:28:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 101 states have (on average 1.118811881188119) internal successors, (113), 106 states have internal predecessors, (113), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-02 16:28:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2023-12-02 16:28:59,596 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 81 [2023-12-02 16:28:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:59,597 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2023-12-02 16:28:59,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 16:28:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2023-12-02 16:28:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-02 16:28:59,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:59,605 INFO L195 NwaCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:59,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 16:28:59,605 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:28:59,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:28:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1347694391, now seen corresponding path program 1 times [2023-12-02 16:28:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:28:59,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525372452] [2023-12-02 16:28:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:59,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:28:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-12-02 16:28:59,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:28:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525372452] [2023-12-02 16:28:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525372452] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:28:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729353564] [2023-12-02 16:28:59,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:28:59,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:28:59,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:28:59,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:28:59,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 16:28:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:28:59,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:28:59,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:28:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-12-02 16:28:59,856 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 16:28:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729353564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:28:59,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 16:28:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-12-02 16:28:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15053363] [2023-12-02 16:28:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:28:59,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 16:28:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:28:59,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 16:28:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:28:59,860 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-02 16:28:59,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:28:59,906 INFO L93 Difference]: Finished difference Result 140 states and 181 transitions. [2023-12-02 16:28:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 16:28:59,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 111 [2023-12-02 16:28:59,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:28:59,909 INFO L225 Difference]: With dead ends: 140 [2023-12-02 16:28:59,909 INFO L226 Difference]: Without dead ends: 139 [2023-12-02 16:28:59,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 16:28:59,911 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 8 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 16:28:59,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 16:28:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-02 16:28:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2023-12-02 16:28:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.099009900990099) internal successors, (111), 105 states have internal predecessors, (111), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-02 16:28:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2023-12-02 16:28:59,932 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 111 [2023-12-02 16:28:59,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:28:59,933 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2023-12-02 16:28:59,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-02 16:28:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2023-12-02 16:28:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 16:28:59,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:28:59,935 INFO L195 NwaCegarLoop]: trace histogram [18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:28:59,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 16:29:00,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:29:00,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:29:00,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:29:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1171146639, now seen corresponding path program 1 times [2023-12-02 16:29:00,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:29:00,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661928055] [2023-12-02 16:29:00,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:00,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:29:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-12-02 16:29:00,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:29:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661928055] [2023-12-02 16:29:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661928055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:29:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999240693] [2023-12-02 16:29:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:00,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:29:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:29:00,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:29:00,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 16:29:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:00,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:29:00,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:29:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-12-02 16:29:00,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:29:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2023-12-02 16:29:00,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999240693] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:29:00,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1208564972] [2023-12-02 16:29:00,499 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2023-12-02 16:29:00,499 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:29:00,499 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:29:00,500 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:29:00,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:29:05,255 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2023-12-02 16:29:05,256 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:29:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1208564972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:29:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:29:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [3, 3, 3] total 33 [2023-12-02 16:29:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781728667] [2023-12-02 16:29:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:29:08,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 16:29:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:29:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 16:29:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 16:29:08,368 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 29 states, 25 states have (on average 2.0) internal successors, (50), 27 states have internal predecessors, (50), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-02 16:29:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:29:12,147 INFO L93 Difference]: Finished difference Result 271 states and 356 transitions. [2023-12-02 16:29:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 16:29:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.0) internal successors, (50), 27 states have internal predecessors, (50), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 112 [2023-12-02 16:29:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:29:12,149 INFO L225 Difference]: With dead ends: 271 [2023-12-02 16:29:12,149 INFO L226 Difference]: Without dead ends: 146 [2023-12-02 16:29:12,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 281 SyntacticMatches, 24 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=561, Invalid=2195, Unknown=0, NotChecked=0, Total=2756 [2023-12-02 16:29:12,151 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 189 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 16:29:12,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 103 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 16:29:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-02 16:29:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-12-02 16:29:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 105 states have (on average 1.0952380952380953) internal successors, (115), 108 states have internal predecessors, (115), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-02 16:29:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 183 transitions. [2023-12-02 16:29:12,171 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 183 transitions. Word has length 112 [2023-12-02 16:29:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:29:12,171 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 183 transitions. [2023-12-02 16:29:12,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.0) internal successors, (50), 27 states have internal predecessors, (50), 6 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-02 16:29:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 183 transitions. [2023-12-02 16:29:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 16:29:12,174 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 16:29:12,174 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:29:12,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 16:29:12,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:29:12,375 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-12-02 16:29:12,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 16:29:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1049392412, now seen corresponding path program 1 times [2023-12-02 16:29:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 16:29:12,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658955816] [2023-12-02 16:29:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 16:29:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-02 16:29:12,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 16:29:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658955816] [2023-12-02 16:29:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658955816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 16:29:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422520574] [2023-12-02 16:29:12,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 16:29:12,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 16:29:12,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 16:29:12,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 16:29:12,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 16:29:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 16:29:12,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 16:29:12,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 16:29:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-02 16:29:12,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 16:29:12,707 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-02 16:29:12,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422520574] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 16:29:12,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601037437] [2023-12-02 16:29:12,711 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2023-12-02 16:29:12,712 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 16:29:12,712 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 16:29:12,712 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 16:29:12,713 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 16:29:14,947 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2023-12-02 16:29:14,948 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 16:29:17,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [601037437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 16:29:17,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 16:29:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [3, 3, 3] total 36 [2023-12-02 16:29:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132453971] [2023-12-02 16:29:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 16:29:17,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-02 16:29:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 16:29:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-02 16:29:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 16:29:17,718 INFO L87 Difference]: Start difference. First operand 142 states and 183 transitions. Second operand has 32 states, 27 states have (on average 1.962962962962963) internal successors, (53), 30 states have internal predecessors, (53), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2023-12-02 16:29:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 16:29:21,272 INFO L93 Difference]: Finished difference Result 164 states and 213 transitions. [2023-12-02 16:29:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-02 16:29:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 1.962962962962963) internal successors, (53), 30 states have internal predecessors, (53), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 124 [2023-12-02 16:29:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 16:29:21,273 INFO L225 Difference]: With dead ends: 164 [2023-12-02 16:29:21,274 INFO L226 Difference]: Without dead ends: 0 [2023-12-02 16:29:21,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 309 SyntacticMatches, 29 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=791, Invalid=3115, Unknown=0, NotChecked=0, Total=3906 [2023-12-02 16:29:21,277 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 217 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 16:29:21,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 44 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 16:29:21,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-02 16:29:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-02 16:29:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 16:29:21,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-02 16:29:21,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2023-12-02 16:29:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 16:29:21,278 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-02 16:29:21,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 1.962962962962963) internal successors, (53), 30 states have internal predecessors, (53), 7 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2023-12-02 16:29:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-02 16:29:21,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-02 16:29:21,280 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2023-12-02 16:29:21,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2023-12-02 16:29:21,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2023-12-02 16:29:21,283 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2023-12-02 16:29:21,284 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2023-12-02 16:29:21,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 16:29:21,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 16:29:21,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-02 16:29:24,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-12-02 16:29:24,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-12-02 16:29:24,506 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-12-02 16:29:24,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,506 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse14 (select |#memory_int| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse5 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~scheme~0#1| 999999)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= 9 (select |#length| 2))) (.cse6 (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~scheme~0#1|)) (.cse8 (= (select |#valid| 1) 1)) (.cse9 (= (select |#valid| 0) 0)) (.cse10 (= (select |#valid| 2) 1)) (.cse11 (= (select .cse14 0) 48)) (.cse12 (= (select .cse14 1) 0)) (.cse13 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 |ULTIMATE.start_main_~urilen~0#1|) .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~urilen~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= .cse5 |ULTIMATE.start_main_~urilen~0#1|) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (< 1 |ULTIMATE.start_main_~cp~0#1|)) .cse13)))) [2023-12-02 16:29:24,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-12-02 16:29:24,506 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (= 2 (select |#length| 1)) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (not (= 0 |ULTIMATE.start_main_~scheme~0#1|)) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (= (select |#valid| 1) 1) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) [2023-12-02 16:29:24,506 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (= 2 (select |#length| 1)) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (not (= 0 |ULTIMATE.start_main_~scheme~0#1|)) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (= (select |#valid| 1) 1) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-12-02 16:29:24,507 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-02 16:29:24,508 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse1 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) (= 2 (select |#length| 1)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (= 9 (select |#length| 2)) (<= 2 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse1 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= 2 |ULTIMATE.start_main_~cp~0#1|))) [2023-12-02 16:29:24,508 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-12-02 16:29:24,508 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse1 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) (= 2 (select |#length| 1)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (= 9 (select |#length| 2)) (<= 2 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse1 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= 2 |ULTIMATE.start_main_~cp~0#1|))) [2023-12-02 16:29:24,508 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2023-12-02 16:29:24,508 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2023-12-02 16:29:24,508 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2023-12-02 16:29:24,508 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (= 2 (select |#length| 1)) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= 2 |ULTIMATE.start_main_~cp~0#1|))) [2023-12-02 16:29:24,509 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (= 2 (select |#length| 1)) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= 2 |ULTIMATE.start_main_~cp~0#1|))) [2023-12-02 16:29:24,509 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-12-02 16:29:24,509 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,509 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-12-02 16:29:24,509 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-12-02 16:29:24,509 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-12-02 16:29:24,509 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 52) no Hoare annotation was computed. [2023-12-02 16:29:24,509 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 52) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) (= 2 (select |#length| 1)) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~scheme~0#1|) (or (and (not (= |ULTIMATE.start_main_~urilen~0#1| |ULTIMATE.start_main_~cp~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 2 |ULTIMATE.start_main_~cp~0#1|)) (and (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) [2023-12-02 16:29:24,509 INFO L895 garLoopResultBuilder]: At program point L47-4(lines 47 52) the Hoare annotation is: (let ((.cse14 (select |#memory_int| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse5 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~scheme~0#1| 999999)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= 9 (select |#length| 2))) (.cse6 (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~scheme~0#1|)) (.cse8 (= (select |#valid| 1) 1)) (.cse9 (= (select |#valid| 0) 0)) (.cse10 (= (select |#valid| 2) 1)) (.cse11 (= (select .cse14 0) 48)) (.cse12 (= (select .cse14 1) 0)) (.cse13 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 |ULTIMATE.start_main_~urilen~0#1|) .cse6 .cse7 .cse8 (<= 2 |ULTIMATE.start_main_~urilen~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= .cse5 |ULTIMATE.start_main_~urilen~0#1|) .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (< 1 |ULTIMATE.start_main_~cp~0#1|)) .cse13)))) [2023-12-02 16:29:24,510 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-12-02 16:29:24,510 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse1 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) (= 2 (select |#length| 1)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (= 9 (select |#length| 2)) (<= 2 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse1 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= 2 |ULTIMATE.start_main_~cp~0#1|))) [2023-12-02 16:29:24,510 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,510 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-02 16:29:24,510 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2023-12-02 16:29:24,510 INFO L895 garLoopResultBuilder]: At program point L56-2(line 56) the Hoare annotation is: (let ((.cse13 (select |#memory_int| 1)) (.cse14 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse2 (<= .cse14 |ULTIMATE.start_main_~urilen~0#1|)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= 9 (select |#length| 2))) (.cse5 (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse6 (= (select |#valid| 1) 1)) (.cse7 (= (select |#valid| 0) 0)) (.cse8 (= (select |#valid| 2) 1)) (.cse9 (= (select .cse13 0) 48)) (.cse10 (not (= .cse14 |ULTIMATE.start_main_~urilen~0#1|))) (.cse11 (= (select .cse13 1) 0)) (.cse12 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~scheme~0#1| 999999) .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~scheme~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 1 |ULTIMATE.start_main_~cp~0#1|) .cse11 .cse12) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~cp~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2023-12-02 16:29:24,510 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2023-12-02 16:29:24,510 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse1 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) (= 2 (select |#length| 1)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (= 9 (select |#length| 2)) (<= 2 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse1 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= 2 |ULTIMATE.start_main_~cp~0#1|))) [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 66) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 77) no Hoare annotation was computed. [2023-12-02 16:29:24,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-12-02 16:29:24,512 INFO L895 garLoopResultBuilder]: At program point L65-5(lines 65 77) the Hoare annotation is: (let ((.cse16 (select |#memory_int| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse2 (<= |ULTIMATE.start_main_~scheme~0#1| 999999)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (<= 3 |ULTIMATE.start_main_~urilen~0#1|)) (.cse5 (= 9 (select |#length| 2))) (.cse6 (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse7 (<= 2 |ULTIMATE.start_main_~scheme~0#1|)) (.cse8 (= (select |#valid| 1) 1)) (.cse9 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse10 (= (select |#valid| 0) 0)) (.cse11 (= (select |#valid| 2) 1)) (.cse12 (= (select .cse16 0) 48)) (.cse13 (= (select .cse16 1) 0)) (.cse14 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) (.cse15 (<= 2 |ULTIMATE.start_main_~cp~0#1|))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2023-12-02 16:29:24,512 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-02 16:29:24,512 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-12-02 16:29:24,512 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse13 (select |#memory_int| 1)) (.cse14 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse2 (<= .cse14 |ULTIMATE.start_main_~urilen~0#1|)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= 9 (select |#length| 2))) (.cse5 (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse6 (= (select |#valid| 1) 1)) (.cse7 (= (select |#valid| 0) 0)) (.cse8 (= (select |#valid| 2) 1)) (.cse9 (= (select .cse13 0) 48)) (.cse10 (not (= .cse14 |ULTIMATE.start_main_~urilen~0#1|))) (.cse11 (= (select .cse13 1) 0)) (.cse12 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~scheme~0#1| 999999) .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~scheme~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 1 |ULTIMATE.start_main_~cp~0#1|) .cse11 .cse12) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~cp~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2023-12-02 16:29:24,512 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-02 16:29:24,512 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-12-02 16:29:24,512 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse1 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) (= 2 (select |#length| 1)) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse1 0) 48) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (= (select .cse1 1) 0) (or (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (< 1 |ULTIMATE.start_main_~cp~0#1|)) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) [2023-12-02 16:29:24,513 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_main_~cp~0#1| 1)) (.cse13 (select |#memory_int| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= 9 (select |#length| 2))) (.cse5 (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse6 (= (select |#valid| 1) 1)) (.cse7 (= (select |#valid| 0) 0)) (.cse8 (= (select |#valid| 2) 1)) (.cse9 (= (select .cse13 0) 48)) (.cse10 (not (= .cse2 |ULTIMATE.start_main_~urilen~0#1|))) (.cse11 (= (select .cse13 1) 0)) (.cse12 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (<= .cse2 |ULTIMATE.start_main_~urilen~0#1|) (<= |ULTIMATE.start_main_~scheme~0#1| 999999) .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_main_~scheme~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 1 |ULTIMATE.start_main_~cp~0#1|) .cse11 .cse12) (and .cse0 .cse1 (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) .cse3 (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse4 (<= 1 |ULTIMATE.start_main_~cp~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,513 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point L58-3(line 58) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L895 garLoopResultBuilder]: At program point L42-2(line 42) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (= 2 (select |#length| 1)) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (not (= 0 |ULTIMATE.start_main_~scheme~0#1|)) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (= (select |#valid| 1) 1) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) [2023-12-02 16:29:24,514 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2023-12-02 16:29:24,514 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse16 (select |#memory_int| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse2 (<= |ULTIMATE.start_main_~scheme~0#1| 999999)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (<= 3 |ULTIMATE.start_main_~urilen~0#1|)) (.cse5 (= 9 (select |#length| 2))) (.cse6 (<= 2 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (= (select |#valid| 1) 1)) (.cse8 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse9 (= (select |#valid| 0) 0)) (.cse10 (= (select |#valid| 2) 1)) (.cse11 (= (select .cse16 0) 48)) (.cse12 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse13 (= (select .cse16 1) 0)) (.cse14 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) (.cse15 (<= 2 |ULTIMATE.start_main_~cp~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 (<= 2 |ULTIMATE.start_main_~tokenlen~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse15 (select |#memory_int| 1)) (.cse16 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse2 (<= .cse16 |ULTIMATE.start_main_~urilen~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~scheme~0#1| 999999)) (.cse4 (= 2 (select |#length| 1))) (.cse5 (= 9 (select |#length| 2))) (.cse6 (<= 2 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (= (select |#valid| 1) 1)) (.cse8 (= (select |#valid| 0) 0)) (.cse9 (= (select |#valid| 2) 1)) (.cse10 (= (select .cse15 0) 48)) (.cse11 (not (= .cse16 |ULTIMATE.start_main_~urilen~0#1|))) (.cse12 (= (select .cse15 1) 0)) (.cse13 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) (.cse14 (<= 2 |ULTIMATE.start_main_~cp~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 (<= 2 |ULTIMATE.start_main_~tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-12-02 16:29:24,515 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (= |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~scheme~0#1|) (= 2 (select |#length| 1)) (<= (+ |ULTIMATE.start_main_~scheme~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (not (= 0 |ULTIMATE.start_main_~scheme~0#1|)) (= 9 (select |#length| 2)) (<= 1 |ULTIMATE.start_main_~tokenlen~0#1|) (= (select |#valid| 1) 1) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) [2023-12-02 16:29:24,516 INFO L899 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-12-02 16:29:24,516 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-12-02 16:29:24,519 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 16:29:24,521 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 16:29:24,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 16:29:24,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 16:29:24,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 16:29:24,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 16:29:24,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 16:29:24,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 16:29:24,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 16:29:24,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 16:29:24,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated [2023-12-02 16:29:24,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated [2023-12-02 16:29:24,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated [2023-12-02 16:29:24,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated [2023-12-02 16:29:24,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated [2023-12-02 16:29:24,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated [2023-12-02 16:29:24,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated [2023-12-02 16:29:24,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:29:24 BoogieIcfgContainer [2023-12-02 16:29:24,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 16:29:24,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 16:29:24,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 16:29:24,537 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 16:29:24,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:28:52" (3/4) ... [2023-12-02 16:29:24,539 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-12-02 16:29:24,542 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-12-02 16:29:24,546 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-12-02 16:29:24,547 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-12-02 16:29:24,547 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-12-02 16:29:24,548 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-12-02 16:29:24,634 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 16:29:24,635 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/witness.yml [2023-12-02 16:29:24,635 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 16:29:24,635 INFO L158 Benchmark]: Toolchain (without parser) took 32755.32ms. Allocated memory was 165.7MB in the beginning and 499.1MB in the end (delta: 333.4MB). Free memory was 127.5MB in the beginning and 189.3MB in the end (delta: -61.8MB). Peak memory consumption was 272.1MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,636 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory was 91.0MB in the beginning and 90.9MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 16:29:24,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.72ms. Allocated memory is still 165.7MB. Free memory was 127.5MB in the beginning and 116.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.81ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 114.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,637 INFO L158 Benchmark]: Boogie Preprocessor took 26.90ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 112.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,637 INFO L158 Benchmark]: RCFGBuilder took 428.05ms. Allocated memory is still 165.7MB. Free memory was 112.8MB in the beginning and 94.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,638 INFO L158 Benchmark]: TraceAbstraction took 31904.91ms. Allocated memory was 165.7MB in the beginning and 499.1MB in the end (delta: 333.4MB). Free memory was 94.0MB in the beginning and 195.6MB in the end (delta: -101.6MB). Peak memory consumption was 258.1MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,638 INFO L158 Benchmark]: Witness Printer took 98.23ms. Allocated memory is still 499.1MB. Free memory was 195.6MB in the beginning and 189.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 16:29:24,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory was 91.0MB in the beginning and 90.9MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.72ms. Allocated memory is still 165.7MB. Free memory was 127.5MB in the beginning and 116.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.81ms. Allocated memory is still 165.7MB. Free memory was 116.2MB in the beginning and 114.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.90ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 112.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.05ms. Allocated memory is still 165.7MB. Free memory was 112.8MB in the beginning and 94.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31904.91ms. Allocated memory was 165.7MB in the beginning and 499.1MB in the end (delta: 333.4MB). Free memory was 94.0MB in the beginning and 195.6MB in the end (delta: -101.6MB). Peak memory consumption was 258.1MB. Max. memory is 16.1GB. * Witness Printer took 98.23ms. Allocated memory is still 499.1MB. Free memory was 195.6MB in the beginning and 189.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[1][1] could not be translated * 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 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1232 mSDsluCounter, 1781 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 883 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3457 IncrementalHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 898 mSDtfsCounter, 3457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1058 GetRequests, 838 SyntacticMatches, 61 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=11, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 160 PreInvPairs, 244 NumberOfFragments, 2025 HoareAnnotationTreeSize, 160 FomulaSimplifications, 7094 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 6440 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 2195 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1169 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 3257/3364 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: OVERALL_TIME: 8.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 282, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 239, TOOLS_POST_TIME: 2.0s, TOOLS_POST_CALL_APPLICATIONS: 216, TOOLS_POST_CALL_TIME: 2.7s, TOOLS_POST_RETURN_APPLICATIONS: 176, TOOLS_POST_RETURN_TIME: 2.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 631, TOOLS_QUANTIFIERELIM_TIME: 6.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 665, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 232, DOMAIN_JOIN_TIME: 1.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 12, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 282, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 5.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 12, CALL_SUMMARIZER_APPLICATIONS: 176, CALL_SUMMARIZER_CACHE_MISSES: 3, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 8128, DAG_COMPRESSION_RETAINED_NODES: 518, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((urilen <= 1000000) && (scheme <= 999999)) && (1 <= tokenlen)) && (1 <= scheme)) && (((!((urilen == cp)) && (cp <= urilen)) && (2 <= cp)) || ((cp == scheme) && ((scheme + 1) <= urilen)))) && (tokenlen <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((c == 0) && (urilen <= 1000000)) && (scheme <= 999999)) && (3 <= urilen)) && (1 <= tokenlen)) && (2 <= scheme)) && (cp <= 1000000)) && (tokenlen <= 1000000)) && (2 <= cp)) || (((((((((urilen <= 1000000) && (scheme <= 999999)) && (1 <= c)) && (3 <= urilen)) && (1 <= tokenlen)) && (2 <= scheme)) && (cp <= 1000000)) && (tokenlen <= 1000000)) && (2 <= cp))) RESULT: Ultimate proved your program to be correct! [2023-12-02 16:29:24,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d5a146e-51ce-46fd-ba4e-7aecfcd7ef09/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE