./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark51_polynomial.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-zilu/benchmark51_polynomial.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa85058e2265737f535eb1fe2c40b3792241244c90bfe02ec1cb86f59e478fdf --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:23:54,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:23:54,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:23:54,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:23:54,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:23:54,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:23:54,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:23:54,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:23:54,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:23:54,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:23:54,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:23:54,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:23:54,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:23:54,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:23:54,542 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:23:54,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:23:54,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:23:54,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:23:54,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:23:54,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:23:54,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:23:54,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:23:54,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:23:54,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:23:54,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:23:54,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:23:54,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:23:54,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:23:54,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:23:54,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:23:54,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:23:54,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:23:54,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:23:54,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:23:54,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:23:54,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:23:54,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:23:54,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:23:54,552 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:23:54,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:23:54,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:23:54,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:23:54,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa85058e2265737f535eb1fe2c40b3792241244c90bfe02ec1cb86f59e478fdf Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:23:54,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:23:54,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:23:54,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:23:54,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:23:54,917 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:23:54,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-zilu/benchmark51_polynomial.i [2024-09-12 18:23:55,694 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:23:57,361 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:23:57,362 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-zilu/benchmark51_polynomial.i [2024-09-12 18:23:57,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/cc983f3fd/49d7b90023cf43569777d7baa22a5b10/FLAGf092f6807 [2024-09-12 18:23:57,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/cc983f3fd/49d7b90023cf43569777d7baa22a5b10 [2024-09-12 18:23:57,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:23:57,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:23:57,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:23:57,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:23:57,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:23:57,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,399 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e41a6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57, skipping insertion in model container [2024-09-12 18:23:57,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:23:57,552 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-zilu/benchmark51_polynomial.i[872,885] [2024-09-12 18:23:57,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:23:57,576 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:23:57,586 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-zilu/benchmark51_polynomial.i[872,885] [2024-09-12 18:23:57,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:23:57,603 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:23:57,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57 WrapperNode [2024-09-12 18:23:57,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:23:57,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:23:57,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:23:57,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:23:57,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,622 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:23:57,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:23:57,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:23:57,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:23:57,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:23:57,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,644 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 18:23:57,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:23:57,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:23:57,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:23:57,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:23:57,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (1/1) ... [2024-09-12 18:23:57,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:23:57,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:23:57,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 18:23:57,697 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 18:23:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:23:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:23:57,739 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:23:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:23:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:23:57,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:23:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:23:57,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:23:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:23:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:23:57,795 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:23:57,797 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:23:57,930 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-09-12 18:23:57,931 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:23:57,951 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:23:57,951 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 18:23:57,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:23:57 BoogieIcfgContainer [2024-09-12 18:23:57,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:23:57,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:23:57,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:23:57,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:23:57,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:23:57" (1/3) ... [2024-09-12 18:23:57,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45297a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:23:57, skipping insertion in model container [2024-09-12 18:23:57,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:23:57" (2/3) ... [2024-09-12 18:23:57,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45297a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:23:57, skipping insertion in model container [2024-09-12 18:23:57,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:23:57" (3/3) ... [2024-09-12 18:23:57,959 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark51_polynomial.i [2024-09-12 18:23:57,971 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:23:57,971 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-09-12 18:23:58,023 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:23:58,030 INFO L336 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4f6e0ac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:23:58,031 INFO L337 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-09-12 18:23:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.65) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 18:23:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:23:58,039 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,039 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,040 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2139408244, now seen corresponding path program 1 times [2024-09-12 18:23:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276263963] [2024-09-12 18:23:58,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276263963] [2024-09-12 18:23:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276263963] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:23:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697536469] [2024-09-12 18:23:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,185 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 18:23:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 18:23:58,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:23:58,205 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.65) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,231 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-09-12 18:23:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 18:23:58,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 18:23:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,237 INFO L225 Difference]: With dead ends: 46 [2024-09-12 18:23:58,238 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 18:23:58,240 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:23:58,243 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 18:23:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-12 18:23:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-12 18:23:58,273 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 11 [2024-09-12 18:23:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,274 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-12 18:23:58,274 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-12 18:23:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 18:23:58,276 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,276 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,276 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:23:58,277 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1455975150, now seen corresponding path program 1 times [2024-09-12 18:23:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340270808] [2024-09-12 18:23:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340270808] [2024-09-12 18:23:58,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340270808] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:23:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523646273] [2024-09-12 18:23:58,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,347 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:23:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:23:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:23:58,348 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,368 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2024-09-12 18:23:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:23:58,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 18:23:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,371 INFO L225 Difference]: With dead ends: 53 [2024-09-12 18:23:58,371 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 18:23:58,372 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:23:58,372 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,373 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 18:23:58,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-12 18:23:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-12 18:23:58,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 10 [2024-09-12 18:23:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,379 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-12 18:23:58,379 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-12 18:23:58,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:23:58,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,380 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:23:58,380 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 966651170, now seen corresponding path program 1 times [2024-09-12 18:23:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921051632] [2024-09-12 18:23:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921051632] [2024-09-12 18:23:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921051632] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:23:58,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7292312] [2024-09-12 18:23:58,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,557 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:23:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:23:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:23:58,558 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,613 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-09-12 18:23:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:23:58,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 18:23:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,614 INFO L225 Difference]: With dead ends: 36 [2024-09-12 18:23:58,616 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 18:23:58,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:23:58,617 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 18:23:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-09-12 18:23:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-09-12 18:23:58,629 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 12 [2024-09-12 18:23:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,629 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-09-12 18:23:58,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-09-12 18:23:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:23:58,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,630 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:23:58,631 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2109416684, now seen corresponding path program 1 times [2024-09-12 18:23:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472905882] [2024-09-12 18:23:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472905882] [2024-09-12 18:23:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472905882] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:23:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254088130] [2024-09-12 18:23:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:23:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:23:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:23:58,688 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,726 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-12 18:23:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:23:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 18:23:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,727 INFO L225 Difference]: With dead ends: 35 [2024-09-12 18:23:58,727 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 18:23:58,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:23:58,728 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,728 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 18:23:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-09-12 18:23:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-12 18:23:58,741 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 11 [2024-09-12 18:23:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,741 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-12 18:23:58,741 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-12 18:23:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:23:58,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,743 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,743 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 18:23:58,743 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2109416876, now seen corresponding path program 1 times [2024-09-12 18:23:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930793015] [2024-09-12 18:23:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930793015] [2024-09-12 18:23:58,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930793015] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:23:58,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206524293] [2024-09-12 18:23:58,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,773 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:23:58,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:23:58,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:23:58,774 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,795 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-12 18:23:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:23:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 18:23:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,797 INFO L225 Difference]: With dead ends: 33 [2024-09-12 18:23:58,797 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 18:23:58,797 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:23:58,798 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,798 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 18:23:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-09-12 18:23:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-12 18:23:58,802 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2024-09-12 18:23:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,803 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-12 18:23:58,803 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-12 18:23:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:23:58,804 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,804 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,804 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:23:58,804 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash 967407830, now seen corresponding path program 1 times [2024-09-12 18:23:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413822296] [2024-09-12 18:23:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413822296] [2024-09-12 18:23:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413822296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:23:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461886638] [2024-09-12 18:23:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,855 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:23:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:23:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:23:58,855 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,870 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-09-12 18:23:58,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:23:58,871 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 18:23:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,871 INFO L225 Difference]: With dead ends: 31 [2024-09-12 18:23:58,872 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 18:23:58,872 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:23:58,873 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 18:23:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 18:23:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-12 18:23:58,883 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2024-09-12 18:23:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,883 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-12 18:23:58,883 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-12 18:23:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:23:58,884 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,884 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,884 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 18:23:58,884 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash 967413788, now seen corresponding path program 1 times [2024-09-12 18:23:58,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837470317] [2024-09-12 18:23:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:58,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837470317] [2024-09-12 18:23:58,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837470317] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:23:58,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913762701] [2024-09-12 18:23:58,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,925 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:23:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:23:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:23:58,926 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,951 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-12 18:23:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:23:58,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 18:23:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,952 INFO L225 Difference]: With dead ends: 56 [2024-09-12 18:23:58,953 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 18:23:58,953 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:23:58,954 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,954 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 18:23:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-09-12 18:23:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-09-12 18:23:58,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2024-09-12 18:23:58,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:58,959 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-09-12 18:23:58,959 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-09-12 18:23:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 18:23:58,959 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:58,960 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:58,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:23:58,960 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:58,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash -469115747, now seen corresponding path program 1 times [2024-09-12 18:23:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760693054] [2024-09-12 18:23:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 18:23:58,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760693054] [2024-09-12 18:23:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760693054] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:58,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:23:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144531335] [2024-09-12 18:23:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:58,985 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:23:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:23:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:23:58,986 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:58,994 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-09-12 18:23:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:23:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 18:23:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:58,996 INFO L225 Difference]: With dead ends: 36 [2024-09-12 18:23:58,996 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 18:23:58,996 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:23:58,997 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:58,997 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:58,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 18:23:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-12 18:23:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-12 18:23:59,001 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2024-09-12 18:23:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:59,001 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-12 18:23:59,002 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-12 18:23:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:23:59,002 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:59,003 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:59,003 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 18:23:59,003 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:59,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 150765037, now seen corresponding path program 1 times [2024-09-12 18:23:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:59,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659976353] [2024-09-12 18:23:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659976353] [2024-09-12 18:23:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659976353] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:23:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157989805] [2024-09-12 18:23:59,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:59,080 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:23:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:59,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:23:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:23:59,081 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:59,119 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-12 18:23:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:23:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 18:23:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:59,120 INFO L225 Difference]: With dead ends: 56 [2024-09-12 18:23:59,120 INFO L226 Difference]: Without dead ends: 29 [2024-09-12 18:23:59,121 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:23:59,121 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:59,122 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-12 18:23:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-12 18:23:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-12 18:23:59,140 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2024-09-12 18:23:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:59,140 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-12 18:23:59,140 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-12 18:23:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 18:23:59,141 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:59,141 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:59,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 18:23:59,142 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:59,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1657679999, now seen corresponding path program 1 times [2024-09-12 18:23:59,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:59,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731570425] [2024-09-12 18:23:59,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:59,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731570425] [2024-09-12 18:23:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731570425] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:59,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:23:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995396253] [2024-09-12 18:23:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:59,201 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:23:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:23:59,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:23:59,202 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:59,227 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-09-12 18:23:59,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:23:59,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 18:23:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:59,228 INFO L225 Difference]: With dead ends: 29 [2024-09-12 18:23:59,228 INFO L226 Difference]: Without dead ends: 28 [2024-09-12 18:23:59,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:23:59,229 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:59,229 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 52 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-12 18:23:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-09-12 18:23:59,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-09-12 18:23:59,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2024-09-12 18:23:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:59,234 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-09-12 18:23:59,234 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-09-12 18:23:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:23:59,235 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:59,235 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:59,235 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 18:23:59,235 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:59,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,236 INFO L85 PathProgramCache]: Analyzing trace with hash 792955059, now seen corresponding path program 1 times [2024-09-12 18:23:59,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:59,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918932867] [2024-09-12 18:23:59,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:59,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:59,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:59,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918932867] [2024-09-12 18:23:59,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918932867] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:23:59,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:23:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 18:23:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39369016] [2024-09-12 18:23:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:23:59,314 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 18:23:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:59,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 18:23:59,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:23:59,315 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:59,357 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-09-12 18:23:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:23:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 18:23:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:59,359 INFO L225 Difference]: With dead ends: 38 [2024-09-12 18:23:59,359 INFO L226 Difference]: Without dead ends: 33 [2024-09-12 18:23:59,359 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:23:59,360 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:59,360 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:23:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-12 18:23:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-09-12 18:23:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-12 18:23:59,364 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2024-09-12 18:23:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:59,364 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-12 18:23:59,364 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-12 18:23:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 18:23:59,365 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:23:59,365 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:23:59,365 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 18:23:59,365 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2024-09-12 18:23:59,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -200862402, now seen corresponding path program 1 times [2024-09-12 18:23:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:23:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871753911] [2024-09-12 18:23:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:23:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:23:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:23:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871753911] [2024-09-12 18:23:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871753911] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:23:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287863105] [2024-09-12 18:23:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:23:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:23:59,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:23:59,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:23:59,457 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 18:23:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:23:59,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 18:23:59,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:23:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:59,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:23:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:23:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287863105] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:23:59,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:23:59,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2024-09-12 18:23:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357391806] [2024-09-12 18:23:59,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:23:59,772 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 18:23:59,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:23:59,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 18:23:59,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-09-12 18:23:59,773 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:23:59,844 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-09-12 18:23:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 18:23:59,845 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-12 18:23:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:23:59,845 INFO L225 Difference]: With dead ends: 44 [2024-09-12 18:23:59,845 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:23:59,846 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-09-12 18:23:59,846 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:23:59,846 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:23:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:23:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:23:59,847 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) [2024-09-12 18:23:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:23:59,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-09-12 18:23:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:23:59,848 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:23:59,848 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 13 states have internal predecessors, (33), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 18:23:59,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:23:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:23:59,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:23:59,851 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2024-09-12 18:23:59,851 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2024-09-12 18:23:59,851 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 7 remaining) [2024-09-12 18:23:59,851 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2024-09-12 18:23:59,851 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2024-09-12 18:23:59,852 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2024-09-12 18:23:59,852 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-09-12 18:23:59,873 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 18:24:00,052 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 18:24:00,057 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:24:00,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:24:00,219 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:24:00,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:24:00 BoogieIcfgContainer [2024-09-12 18:24:00,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:24:00,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:24:00,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:24:00,239 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:24:00,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:23:57" (3/4) ... [2024-09-12 18:24:00,241 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:24:00,244 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:24:00,247 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:24:00,247 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 18:24:00,250 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-12 18:24:00,250 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 18:24:00,250 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 18:24:00,250 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 18:24:00,355 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:24:00,355 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:24:00,355 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:24:00,356 INFO L158 Benchmark]: Toolchain (without parser) took 2964.77ms. Allocated memory was 60.8MB in the beginning and 96.5MB in the end (delta: 35.7MB). Free memory was 29.8MB in the beginning and 68.3MB in the end (delta: -38.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:24:00,356 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 60.8MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:24:00,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.01ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 29.7MB in the beginning and 55.4MB in the end (delta: -25.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-09-12 18:24:00,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.02ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 54.6MB in the end (delta: 874.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:24:00,357 INFO L158 Benchmark]: Boogie Preprocessor took 32.22ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 52.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:24:00,357 INFO L158 Benchmark]: RCFGBuilder took 295.85ms. Allocated memory is still 79.7MB. Free memory was 52.8MB in the beginning and 40.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 18:24:00,357 INFO L158 Benchmark]: TraceAbstraction took 2281.05ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 39.9MB in the beginning and 73.5MB in the end (delta: -33.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-09-12 18:24:00,358 INFO L158 Benchmark]: Witness Printer took 120.31ms. Allocated memory is still 96.5MB. Free memory was 73.4MB in the beginning and 68.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 18:24:00,359 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.29ms. Allocated memory is still 60.8MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.01ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 29.7MB in the beginning and 55.4MB in the end (delta: -25.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.02ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 54.6MB in the end (delta: 874.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.22ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 52.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 295.85ms. Allocated memory is still 79.7MB. Free memory was 52.8MB in the beginning and 40.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2281.05ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 39.9MB in the beginning and 73.5MB in the end (delta: -33.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Witness Printer took 120.31ms. Allocated memory is still 96.5MB. Free memory was 73.4MB in the beginning and 68.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 732 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 395 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 252 mSDtfsCounter, 395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 17 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 528 SizeOfPredicates, 1 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 29/35 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((0 <= x) && (x <= 50)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:24:00,380 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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