./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/simple_1-2_abstracted.c --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-acceleration/simple_1-2_abstracted.c -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 cc40d4ad6a7bdf39bf9f58b5e7bf6c9907d8f0f2ffcd427a55e83ad7fe6ca0b0 --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 17:55:25,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:55:25,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:55:25,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:55:25,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:55:25,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:55:25,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:55:25,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:55:25,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:55:25,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:55:25,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:55:25,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:55:25,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:55:25,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:55:25,445 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:55:25,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:55:25,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:55:25,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:55:25,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:55:25,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:55:25,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:55:25,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:55:25,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:55:25,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:55:25,450 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:55:25,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:55:25,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:55:25,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:55:25,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:55:25,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:55:25,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:55:25,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:55:25,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:55:25,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:55:25,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:55:25,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:55:25,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:55:25,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:55:25,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:55:25,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:55:25,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:55:25,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:55:25,454 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 -> cc40d4ad6a7bdf39bf9f58b5e7bf6c9907d8f0f2ffcd427a55e83ad7fe6ca0b0 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 17:55:25,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:55:25,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:55:25,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:55:25,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:55:25,739 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:55:25,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-acceleration/simple_1-2_abstracted.c [2024-09-12 17:55:26,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:55:27,114 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:55:27,115 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/simple_1-2_abstracted.c [2024-09-12 17:55:27,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8a108dbbd/ba03aea81d6248d792f0cd69bdd1e8b0/FLAG012fd3307 [2024-09-12 17:55:27,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8a108dbbd/ba03aea81d6248d792f0cd69bdd1e8b0 [2024-09-12 17:55:27,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:55:27,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:55:27,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:55:27,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:55:27,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:55:27,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bf7bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27, skipping insertion in model container [2024-09-12 17:55:27,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:55:27,253 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-acceleration/simple_1-2_abstracted.c[740,753] [2024-09-12 17:55:27,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:55:27,268 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:55:27,287 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-acceleration/simple_1-2_abstracted.c[740,753] [2024-09-12 17:55:27,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:55:27,301 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:55:27,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27 WrapperNode [2024-09-12 17:55:27,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:55:27,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:55:27,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:55:27,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:55:27,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,316 INFO L138 Inliner]: procedures = 20, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:55:27,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:55:27,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:55:27,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:55:27,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:55:27,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,332 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 17:55:27,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,334 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:55:27,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:55:27,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:55:27,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:55:27,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (1/1) ... [2024-09-12 17:55:27,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:55:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:27,362 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 17:55:27,366 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 17:55:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:55:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:55:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:55:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:55:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:55:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:55:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:55:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:55:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 17:55:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 17:55:27,451 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:55:27,453 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:55:27,579 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-09-12 17:55:27,583 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:55:27,603 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:55:27,603 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 17:55:27,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:55:27 BoogieIcfgContainer [2024-09-12 17:55:27,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:55:27,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:55:27,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:55:27,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:55:27,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:55:27" (1/3) ... [2024-09-12 17:55:27,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c74900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:55:27, skipping insertion in model container [2024-09-12 17:55:27,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:27" (2/3) ... [2024-09-12 17:55:27,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c74900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:55:27, skipping insertion in model container [2024-09-12 17:55:27,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:55:27" (3/3) ... [2024-09-12 17:55:27,613 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_1-2_abstracted.c [2024-09-12 17:55:27,626 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:55:27,626 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-09-12 17:55:27,673 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:55:27,679 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;@1d44e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:55:27,679 INFO L337 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-09-12 17:55:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 states have internal predecessors, (28), 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 17:55:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-12 17:55:27,686 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:27,687 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:27,688 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 17:55:27,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 861399646, now seen corresponding path program 1 times [2024-09-12 17:55:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143380882] [2024-09-12 17:55:27,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:27,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:27,851 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 17:55:27,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143380882] [2024-09-12 17:55:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143380882] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:55:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295255756] [2024-09-12 17:55:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:27,858 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:55:27,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:27,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:55:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:27,880 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 26 states have internal predecessors, (28), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 17:55:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:27,921 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-09-12 17:55:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:55:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2024-09-12 17:55:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:27,930 INFO L225 Difference]: With dead ends: 39 [2024-09-12 17:55:27,931 INFO L226 Difference]: Without dead ends: 25 [2024-09-12 17:55:27,934 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 17:55:27,937 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 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 17:55:27,939 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-12 17:55:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-12 17:55:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.5) internal successors, (21), 20 states have internal predecessors, (21), 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 17:55:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-09-12 17:55:27,968 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 7 [2024-09-12 17:55:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:27,969 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-09-12 17:55:27,970 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 17:55:27,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-09-12 17:55:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 17:55:27,971 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:27,971 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:27,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:55:27,971 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 17:55:27,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:27,972 INFO L85 PathProgramCache]: Analyzing trace with hash 933585292, now seen corresponding path program 1 times [2024-09-12 17:55:27,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:27,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812529893] [2024-09-12 17:55:27,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,037 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 17:55:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812529893] [2024-09-12 17:55:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812529893] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:55:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030505601] [2024-09-12 17:55:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:28,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:55:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:55:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:28,043 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 17:55:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:28,067 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-09-12 17:55:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:55:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 8 [2024-09-12 17:55:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:28,068 INFO L225 Difference]: With dead ends: 25 [2024-09-12 17:55:28,069 INFO L226 Difference]: Without dead ends: 23 [2024-09-12 17:55:28,069 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 17:55:28,070 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:28,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-12 17:55:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-12 17:55:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 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 17:55:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-09-12 17:55:28,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 8 [2024-09-12 17:55:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:28,078 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-09-12 17:55:28,078 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 17:55:28,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,079 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-09-12 17:55:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 17:55:28,079 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:28,080 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:28,080 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:55:28,080 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 17:55:28,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash -455013872, now seen corresponding path program 1 times [2024-09-12 17:55:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:28,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719724461] [2024-09-12 17:55:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,174 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 17:55:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719724461] [2024-09-12 17:55:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719724461] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:28,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:28,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:55:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720931000] [2024-09-12 17:55:28,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:28,180 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:55:28,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:28,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:55:28,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:28,182 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:55:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:28,199 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2024-09-12 17:55:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:55:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 10 [2024-09-12 17:55:28,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:28,201 INFO L225 Difference]: With dead ends: 28 [2024-09-12 17:55:28,201 INFO L226 Difference]: Without dead ends: 23 [2024-09-12 17:55:28,201 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 17:55:28,202 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:28,207 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-12 17:55:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-12 17:55:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 18 states have internal predecessors, (18), 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 17:55:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2024-09-12 17:55:28,212 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 10 [2024-09-12 17:55:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:28,212 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2024-09-12 17:55:28,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:55:28,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-09-12 17:55:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 17:55:28,213 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:28,213 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:28,213 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:55:28,214 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 17:55:28,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1768731166, now seen corresponding path program 1 times [2024-09-12 17:55:28,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:28,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210344329] [2024-09-12 17:55:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,328 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 17:55:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210344329] [2024-09-12 17:55:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210344329] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:28,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:55:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301369422] [2024-09-12 17:55:28,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:28,330 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:55:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:55:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:55:28,331 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 17:55:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:28,357 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2024-09-12 17:55:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:55:28,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 17:55:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:28,358 INFO L225 Difference]: With dead ends: 23 [2024-09-12 17:55:28,358 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 17:55:28,358 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:55:28,359 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:28,359 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 17:55:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-12 17:55:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 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 17:55:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2024-09-12 17:55:28,362 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 11 [2024-09-12 17:55:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:28,363 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2024-09-12 17:55:28,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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 17:55:28,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-09-12 17:55:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:55:28,363 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:28,364 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:28,364 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:55:28,364 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 17:55:28,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1003908752, now seen corresponding path program 1 times [2024-09-12 17:55:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:28,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394193632] [2024-09-12 17:55:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,468 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 17:55:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394193632] [2024-09-12 17:55:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394193632] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:55:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326262324] [2024-09-12 17:55:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:28,472 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:55:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:55:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:55:28,475 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 17:55:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:28,516 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2024-09-12 17:55:28,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:55:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 17:55:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:28,517 INFO L225 Difference]: With dead ends: 21 [2024-09-12 17:55:28,517 INFO L226 Difference]: Without dead ends: 19 [2024-09-12 17:55:28,517 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:55:28,518 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:28,518 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-12 17:55:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-12 17:55:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 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 17:55:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2024-09-12 17:55:28,524 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 12 [2024-09-12 17:55:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:28,524 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2024-09-12 17:55:28,524 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 17:55:28,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-09-12 17:55:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:55:28,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:28,525 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:28,525 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:55:28,525 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2024-09-12 17:55:28,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1910163194, now seen corresponding path program 1 times [2024-09-12 17:55:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:28,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324736643] [2024-09-12 17:55:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:28,697 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 17:55:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324736643] [2024-09-12 17:55:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324736643] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:55:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483508502] [2024-09-12 17:55:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:28,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:55:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:55:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:55:28,701 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) 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 17:55:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:28,729 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2024-09-12 17:55:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:55:28,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) 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 17:55:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:28,730 INFO L225 Difference]: With dead ends: 19 [2024-09-12 17:55:28,730 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 17:55:28,731 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:55:28,734 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:28,735 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 17:55:28,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 17:55:28,736 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 17:55:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 17:55:28,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-09-12 17:55:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:28,736 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 17:55:28,736 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) 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 17:55:28,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 17:55:28,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 17:55:28,738 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2024-09-12 17:55:28,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2024-09-12 17:55:28,740 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:55:28,746 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-12 17:55:28,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 17:55:28,841 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 17:55:28,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 05:55:28 BoogieIcfgContainer [2024-09-12 17:55:28,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 17:55:28,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 17:55:28,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 17:55:28,857 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 17:55:28,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:55:27" (3/4) ... [2024-09-12 17:55:28,859 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 17:55:28,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 17:55:28,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 17:55:28,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 17:55:28,864 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 17:55:28,864 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 17:55:28,864 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 17:55:28,864 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 17:55:28,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 17:55:28,928 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 17:55:28,928 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 17:55:28,928 INFO L158 Benchmark]: Toolchain (without parser) took 1796.41ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 43.8MB in the beginning and 64.8MB in the end (delta: -21.0MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-09-12 17:55:28,929 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:55:28,929 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.97ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 57.9MB in the end (delta: -14.3MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-09-12 17:55:28,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 13.85ms. Allocated memory is still 77.6MB. Free memory was 57.9MB in the beginning and 57.1MB in the end (delta: 841.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 17:55:28,929 INFO L158 Benchmark]: Boogie Preprocessor took 20.62ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 55.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:55:28,929 INFO L158 Benchmark]: RCFGBuilder took 267.10ms. Allocated memory is still 77.6MB. Free memory was 55.3MB in the beginning and 42.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 17:55:28,929 INFO L158 Benchmark]: TraceAbstraction took 1249.18ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 42.1MB in the beginning and 69.8MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:55:28,930 INFO L158 Benchmark]: Witness Printer took 71.91ms. Allocated memory is still 104.9MB. Free memory was 69.8MB in the beginning and 64.8MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 17:55:28,932 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.19ms. Allocated memory is still 77.6MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.97ms. Allocated memory is still 77.6MB. Free memory was 43.6MB in the beginning and 57.9MB in the end (delta: -14.3MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 13.85ms. Allocated memory is still 77.6MB. Free memory was 57.9MB in the beginning and 57.1MB in the end (delta: 841.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.62ms. Allocated memory is still 77.6MB. Free memory was 57.1MB in the beginning and 55.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.10ms. Allocated memory is still 77.6MB. Free memory was 55.3MB in the beginning and 42.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1249.18ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 42.1MB in the beginning and 69.8MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.91ms. Allocated memory is still 104.9MB. Free memory was 69.8MB in the beginning and 64.8MB in the end (delta: 5.0MB). 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: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: 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, 33 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 89 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 9 specifications checked. All of them hold - ProcedureContractResult [Line: 15]: 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 17:55:28,956 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