./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i5_o5-2.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/recursive-simple/id_i5_o5-2.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 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 --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 19:54:31,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:54:31,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:54:31,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:54:31,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:54:31,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:54:31,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:54:31,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:54:31,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:54:31,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:54:31,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:54:31,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:54:31,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:54:31,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:54:31,942 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:54:31,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:54:31,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:54:31,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:54:31,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:54:31,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:54:31,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:54:31,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:54:31,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:54:31,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:54:31,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:54:31,947 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:54:31,948 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:54:31,948 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:54:31,948 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:54:31,948 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:54:31,948 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:54:31,948 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:54:31,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:54:31,949 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:54:31,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:54:31,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:54:31,950 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 -> 1be5a7d97aa41e02c549ddce0b54861696e25bfa9b91d41dbf151eb81f7686c7 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 19:54:32,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:54:32,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:54:32,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:54:32,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:54:32,236 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:54:32,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2024-09-12 19:54:33,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:54:33,759 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:54:33,759 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i5_o5-2.c [2024-09-12 19:54:33,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1623dbbab/7aba47fc593e4d51a9eb669632014d1b/FLAGc945d7067 [2024-09-12 19:54:33,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1623dbbab/7aba47fc593e4d51a9eb669632014d1b [2024-09-12 19:54:33,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:54:33,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:54:33,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:54:33,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:54:33,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:54:33,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:54:33" (1/1) ... [2024-09-12 19:54:33,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2a9663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:33, skipping insertion in model container [2024-09-12 19:54:33,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:54:33" (1/1) ... [2024-09-12 19:54:33,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:54:33,960 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/recursive-simple/id_i5_o5-2.c[450,463] [2024-09-12 19:54:33,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:54:33,979 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:54:33,991 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/recursive-simple/id_i5_o5-2.c[450,463] [2024-09-12 19:54:33,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:54:34,007 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:54:34,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34 WrapperNode [2024-09-12 19:54:34,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:54:34,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:54:34,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:54:34,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:54:34,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,026 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:54:34,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:54:34,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:54:34,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:54:34,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:54:34,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,049 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 19:54:34,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,053 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:54:34,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:54:34,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:54:34,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:54:34,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (1/1) ... [2024-09-12 19:54:34,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:54:34,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:34,091 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 19:54:34,096 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 19:54:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:54:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:54:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:54:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:54:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:54:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:54:34,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:54:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:54:34,133 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-12 19:54:34,134 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-12 19:54:34,183 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:54:34,185 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:54:34,312 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-12 19:54:34,314 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:54:34,334 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:54:34,335 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:54:34,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:54:34 BoogieIcfgContainer [2024-09-12 19:54:34,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:54:34,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:54:34,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:54:34,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:54:34,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:54:33" (1/3) ... [2024-09-12 19:54:34,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11615603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:54:34, skipping insertion in model container [2024-09-12 19:54:34,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:34" (2/3) ... [2024-09-12 19:54:34,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11615603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:54:34, skipping insertion in model container [2024-09-12 19:54:34,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:54:34" (3/3) ... [2024-09-12 19:54:34,343 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i5_o5-2.c [2024-09-12 19:54:34,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:54:34,356 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 19:54:34,408 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:54:34,415 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;@42a7c2f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:54:34,416 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 19:54:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:54:34,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-12 19:54:34,426 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:34,426 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:34,427 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:34,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 697441800, now seen corresponding path program 1 times [2024-09-12 19:54:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:34,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781689344] [2024-09-12 19:54:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,656 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 19:54:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:34,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781689344] [2024-09-12 19:54:34,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781689344] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:54:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747170566] [2024-09-12 19:54:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:34,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:54:34,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:54:34,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:54:34,689 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 19:54:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:34,793 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-09-12 19:54:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:54:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 9 [2024-09-12 19:54:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:34,802 INFO L225 Difference]: With dead ends: 52 [2024-09-12 19:54:34,802 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 19:54:34,805 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:54:34,809 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:34,811 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 82 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 19:54:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-09-12 19:54:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.380952380952381) internal successors, (29), 25 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:54:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-12 19:54:34,862 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2024-09-12 19:54:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:34,862 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-12 19:54:34,863 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 19:54:34,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-12 19:54:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 19:54:34,864 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:34,864 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:34,865 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:54:34,865 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:34,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:34,866 INFO L85 PathProgramCache]: Analyzing trace with hash 145859376, now seen corresponding path program 1 times [2024-09-12 19:54:34,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:34,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808359703] [2024-09-12 19:54:34,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:34,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,937 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 19:54:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808359703] [2024-09-12 19:54:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808359703] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:54:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481615576] [2024-09-12 19:54:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:34,942 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:54:34,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:34,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:54:34,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:54:34,944 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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 19:54:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:35,007 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-09-12 19:54:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:54:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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 19:54:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:35,009 INFO L225 Difference]: With dead ends: 36 [2024-09-12 19:54:35,010 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 19:54:35,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:54:35,011 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:35,013 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 19:54:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-12 19:54:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 19:54:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-09-12 19:54:35,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2024-09-12 19:54:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:35,033 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-09-12 19:54:35,033 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 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 19:54:35,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-09-12 19:54:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 19:54:35,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:35,035 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:35,035 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:54:35,035 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:35,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1139611612, now seen corresponding path program 1 times [2024-09-12 19:54:35,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:35,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978399462] [2024-09-12 19:54:35,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:35,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978399462] [2024-09-12 19:54:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978399462] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098853580] [2024-09-12 19:54:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:35,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:35,149 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 19:54:35,152 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 19:54:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 19:54:35,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:35,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098853580] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:35,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-12 19:54:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30900752] [2024-09-12 19:54:35,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:35,287 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 19:54:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 19:54:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:54:35,288 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 5 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:54:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:35,440 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-09-12 19:54:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:54:35,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 5 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 19:54:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:35,442 INFO L225 Difference]: With dead ends: 91 [2024-09-12 19:54:35,442 INFO L226 Difference]: Without dead ends: 77 [2024-09-12 19:54:35,443 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-09-12 19:54:35,443 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 99 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:35,444 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 144 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-12 19:54:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2024-09-12 19:54:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 48 states have internal predecessors, (59), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 19:54:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-09-12 19:54:35,468 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 14 [2024-09-12 19:54:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:35,469 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-09-12 19:54:35,469 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 5 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:54:35,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-09-12 19:54:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 19:54:35,470 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:35,470 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:35,482 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 19:54:35,674 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:35,675 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:35,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 482378263, now seen corresponding path program 1 times [2024-09-12 19:54:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754952702] [2024-09-12 19:54:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 19:54:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:54:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754952702] [2024-09-12 19:54:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754952702] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:54:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183134897] [2024-09-12 19:54:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:35,769 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:54:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:54:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:54:35,770 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:54:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:35,848 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2024-09-12 19:54:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:54:35,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-12 19:54:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:35,850 INFO L225 Difference]: With dead ends: 83 [2024-09-12 19:54:35,850 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 19:54:35,850 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 19:54:35,851 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:35,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 19:54:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-12 19:54:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 62 states have internal predecessors, (74), 8 states have call successors, (8), 7 states have call predecessors, (8), 9 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 19:54:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-09-12 19:54:35,875 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 22 [2024-09-12 19:54:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:35,875 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-09-12 19:54:35,875 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:54:35,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-09-12 19:54:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:54:35,876 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:35,880 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:35,880 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:54:35,880 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:35,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash -603481423, now seen corresponding path program 1 times [2024-09-12 19:54:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:35,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320304051] [2024-09-12 19:54:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:35,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:54:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 19:54:35,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320304051] [2024-09-12 19:54:35,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320304051] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:35,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:35,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:54:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119360780] [2024-09-12 19:54:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:35,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:54:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:54:35,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:54:35,940 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:54:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:35,960 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2024-09-12 19:54:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:54:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-09-12 19:54:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:35,963 INFO L225 Difference]: With dead ends: 81 [2024-09-12 19:54:35,965 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 19:54:35,965 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 19:54:35,966 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 37 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 19:54:35,966 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 37 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 19:54:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-12 19:54:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.15) internal successors, (69), 61 states have internal predecessors, (69), 8 states have call successors, (8), 7 states have call predecessors, (8), 9 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 19:54:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-09-12 19:54:35,998 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 27 [2024-09-12 19:54:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:35,999 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-09-12 19:54:35,999 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:54:35,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-09-12 19:54:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 19:54:36,000 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:36,000 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:36,000 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:54:36,000 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:36,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1734641416, now seen corresponding path program 2 times [2024-09-12 19:54:36,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:36,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390098465] [2024-09-12 19:54:36,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:36,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:36,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:36,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:36,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390098465] [2024-09-12 19:54:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390098465] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:36,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169237997] [2024-09-12 19:54:36,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:54:36,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:36,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:36,206 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 19:54:36,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:54:36,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:36,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 19:54:36,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:36,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:36,486 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169237997] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:36,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:36,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-09-12 19:54:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883469690] [2024-09-12 19:54:36,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:36,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 19:54:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:36,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 19:54:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-09-12 19:54:36,488 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 11 states have call successors, (12), 11 states have call predecessors, (12), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:54:36,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:36,826 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2024-09-12 19:54:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-12 19:54:36,826 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 11 states have call successors, (12), 11 states have call predecessors, (12), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-12 19:54:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:36,828 INFO L225 Difference]: With dead ends: 203 [2024-09-12 19:54:36,828 INFO L226 Difference]: Without dead ends: 165 [2024-09-12 19:54:36,828 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2024-09-12 19:54:36,831 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 227 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:36,832 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 272 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:54:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-09-12 19:54:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2024-09-12 19:54:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.15) internal successors, (138), 121 states have internal predecessors, (138), 14 states have call successors, (14), 13 states have call predecessors, (14), 18 states have return successors, (20), 20 states have call predecessors, (20), 13 states have call successors, (20) [2024-09-12 19:54:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2024-09-12 19:54:36,872 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 29 [2024-09-12 19:54:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:36,873 INFO L474 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2024-09-12 19:54:36,873 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 14 states have internal predecessors, (41), 11 states have call successors, (12), 11 states have call predecessors, (12), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:54:36,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2024-09-12 19:54:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 19:54:36,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:36,874 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:36,887 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:54:37,074 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 19:54:37,075 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:37,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2132070951, now seen corresponding path program 1 times [2024-09-12 19:54:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12389287] [2024-09-12 19:54:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:37,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:37,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:54:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:37,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-12 19:54:37,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:37,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12389287] [2024-09-12 19:54:37,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12389287] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:37,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404095863] [2024-09-12 19:54:37,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:37,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:37,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:37,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:37,185 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 19:54:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:37,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 19:54:37,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 19:54:37,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 19:54:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404095863] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:37,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-09-12 19:54:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604776629] [2024-09-12 19:54:37,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:37,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 19:54:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 19:54:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-09-12 19:54:37,329 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 19:54:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:37,435 INFO L93 Difference]: Finished difference Result 285 states and 331 transitions. [2024-09-12 19:54:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:54:37,436 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2024-09-12 19:54:37,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:37,438 INFO L225 Difference]: With dead ends: 285 [2024-09-12 19:54:37,438 INFO L226 Difference]: Without dead ends: 284 [2024-09-12 19:54:37,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-09-12 19:54:37,439 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:37,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-09-12 19:54:37,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-09-12 19:54:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 225 states have (on average 1.08) internal successors, (243), 223 states have internal predecessors, (243), 14 states have call successors, (14), 13 states have call predecessors, (14), 42 states have return successors, (47), 47 states have call predecessors, (47), 13 states have call successors, (47) [2024-09-12 19:54:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 304 transitions. [2024-09-12 19:54:37,492 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 304 transitions. Word has length 43 [2024-09-12 19:54:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:37,493 INFO L474 AbstractCegarLoop]: Abstraction has 284 states and 304 transitions. [2024-09-12 19:54:37,493 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-12 19:54:37,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 304 transitions. [2024-09-12 19:54:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 19:54:37,494 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:37,494 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:37,508 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:54:37,695 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 19:54:37,695 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:37,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1956580216, now seen corresponding path program 3 times [2024-09-12 19:54:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344653286] [2024-09-12 19:54:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:38,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344653286] [2024-09-12 19:54:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344653286] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143852136] [2024-09-12 19:54:38,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:54:38,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:38,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:38,075 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 19:54:38,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-12 19:54:38,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:38,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 19:54:38,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:38,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:54:38,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143852136] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:38,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:38,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-09-12 19:54:38,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468318984] [2024-09-12 19:54:38,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:38,694 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-12 19:54:38,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:38,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-12 19:54:38,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 19:54:38,696 INFO L87 Difference]: Start difference. First operand 284 states and 304 transitions. Second operand has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 23 states have call successors, (24), 23 states have call predecessors, (24), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:54:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:38,871 INFO L93 Difference]: Finished difference Result 289 states and 304 transitions. [2024-09-12 19:54:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 19:54:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 23 states have call successors, (24), 23 states have call predecessors, (24), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-09-12 19:54:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:38,874 INFO L225 Difference]: With dead ends: 289 [2024-09-12 19:54:38,874 INFO L226 Difference]: Without dead ends: 288 [2024-09-12 19:54:38,875 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=860, Invalid=2110, Unknown=0, NotChecked=0, Total=2970 [2024-09-12 19:54:38,875 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 183 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:38,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 208 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-12 19:54:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 283. [2024-09-12 19:54:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.0755555555555556) internal successors, (242), 222 states have internal predecessors, (242), 14 states have call successors, (14), 13 states have call predecessors, (14), 42 states have return successors, (47), 47 states have call predecessors, (47), 13 states have call successors, (47) [2024-09-12 19:54:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 303 transitions. [2024-09-12 19:54:38,921 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 303 transitions. Word has length 59 [2024-09-12 19:54:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:38,922 INFO L474 AbstractCegarLoop]: Abstraction has 283 states and 303 transitions. [2024-09-12 19:54:38,922 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 26 states have internal predecessors, (89), 23 states have call successors, (24), 23 states have call predecessors, (24), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:54:38,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 303 transitions. [2024-09-12 19:54:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 19:54:38,924 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:38,925 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:38,941 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:54:39,125 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:39,126 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:39,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1174335707, now seen corresponding path program 2 times [2024-09-12 19:54:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:39,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146064139] [2024-09-12 19:54:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:54:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-12 19:54:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146064139] [2024-09-12 19:54:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146064139] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339224165] [2024-09-12 19:54:39,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:54:39,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:39,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:39,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:39,367 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 19:54:39,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:54:39,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:39,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 19:54:39,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 19:54:39,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:39,877 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 19:54:39,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339224165] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:39,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:39,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-09-12 19:54:39,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144803956] [2024-09-12 19:54:39,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:39,878 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 19:54:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:39,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 19:54:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2024-09-12 19:54:39,879 INFO L87 Difference]: Start difference. First operand 283 states and 303 transitions. Second operand has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) [2024-09-12 19:54:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:40,132 INFO L93 Difference]: Finished difference Result 612 states and 703 transitions. [2024-09-12 19:54:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-12 19:54:40,133 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) Word has length 58 [2024-09-12 19:54:40,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:40,136 INFO L225 Difference]: With dead ends: 612 [2024-09-12 19:54:40,136 INFO L226 Difference]: Without dead ends: 611 [2024-09-12 19:54:40,137 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:54:40,138 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:40,138 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 105 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:40,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-09-12 19:54:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 426. [2024-09-12 19:54:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 343 states have (on average 1.0495626822157433) internal successors, (360), 334 states have internal predecessors, (360), 14 states have call successors, (14), 13 states have call predecessors, (14), 67 states have return successors, (78), 78 states have call predecessors, (78), 13 states have call successors, (78) [2024-09-12 19:54:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 452 transitions. [2024-09-12 19:54:40,217 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 452 transitions. Word has length 58 [2024-09-12 19:54:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:40,217 INFO L474 AbstractCegarLoop]: Abstraction has 426 states and 452 transitions. [2024-09-12 19:54:40,217 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.25) internal successors, (54), 25 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 1 states have call successors, (12) [2024-09-12 19:54:40,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 452 transitions. [2024-09-12 19:54:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 19:54:40,218 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:40,218 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:40,234 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 19:54:40,422 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:40,423 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:40,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash -853273017, now seen corresponding path program 1 times [2024-09-12 19:54:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661025343] [2024-09-12 19:54:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:54:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-12 19:54:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661025343] [2024-09-12 19:54:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661025343] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616536735] [2024-09-12 19:54:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:40,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:40,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:40,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:40,758 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 19:54:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:40,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-12 19:54:40,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 19:54:40,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-12 19:54:41,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616536735] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:41,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:41,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2024-09-12 19:54:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965281121] [2024-09-12 19:54:41,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:41,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 19:54:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 19:54:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-09-12 19:54:41,024 INFO L87 Difference]: Start difference. First operand 426 states and 452 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 7 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 19:54:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:41,327 INFO L93 Difference]: Finished difference Result 565 states and 590 transitions. [2024-09-12 19:54:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 19:54:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 7 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2024-09-12 19:54:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:41,330 INFO L225 Difference]: With dead ends: 565 [2024-09-12 19:54:41,331 INFO L226 Difference]: Without dead ends: 534 [2024-09-12 19:54:41,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-09-12 19:54:41,332 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:41,332 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 206 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-09-12 19:54:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 426. [2024-09-12 19:54:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 343 states have (on average 1.0466472303206997) internal successors, (359), 334 states have internal predecessors, (359), 14 states have call successors, (14), 13 states have call predecessors, (14), 67 states have return successors, (78), 78 states have call predecessors, (78), 13 states have call successors, (78) [2024-09-12 19:54:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 451 transitions. [2024-09-12 19:54:41,390 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 451 transitions. Word has length 63 [2024-09-12 19:54:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:41,390 INFO L474 AbstractCegarLoop]: Abstraction has 426 states and 451 transitions. [2024-09-12 19:54:41,390 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 7 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 19:54:41,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 451 transitions. [2024-09-12 19:54:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-12 19:54:41,391 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:41,392 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:41,404 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 19:54:41,592 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 19:54:41,593 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:41,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1837267147, now seen corresponding path program 2 times [2024-09-12 19:54:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226265279] [2024-09-12 19:54:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:54:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-09-12 19:54:41,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:41,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226265279] [2024-09-12 19:54:41,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226265279] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:41,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943856330] [2024-09-12 19:54:41,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:54:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:41,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:41,907 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 19:54:41,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:54:41,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:41,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 19:54:41,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-09-12 19:54:42,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:54:42,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943856330] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:42,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:54:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 14 [2024-09-12 19:54:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996170626] [2024-09-12 19:54:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:42,035 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 19:54:42,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 19:54:42,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:54:42,036 INFO L87 Difference]: Start difference. First operand 426 states and 451 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-12 19:54:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:42,188 INFO L93 Difference]: Finished difference Result 534 states and 559 transitions. [2024-09-12 19:54:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:54:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2024-09-12 19:54:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:42,190 INFO L225 Difference]: With dead ends: 534 [2024-09-12 19:54:42,191 INFO L226 Difference]: Without dead ends: 372 [2024-09-12 19:54:42,191 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2024-09-12 19:54:42,192 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:42,192 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 121 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-09-12 19:54:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-09-12 19:54:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 300 states have (on average 1.0366666666666666) internal successors, (311), 291 states have internal predecessors, (311), 14 states have call successors, (14), 13 states have call predecessors, (14), 57 states have return successors, (67), 67 states have call predecessors, (67), 12 states have call successors, (67) [2024-09-12 19:54:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 392 transitions. [2024-09-12 19:54:42,237 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 392 transitions. Word has length 73 [2024-09-12 19:54:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:42,237 INFO L474 AbstractCegarLoop]: Abstraction has 372 states and 392 transitions. [2024-09-12 19:54:42,237 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-12 19:54:42,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 392 transitions. [2024-09-12 19:54:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-12 19:54:42,239 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:42,239 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:42,254 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 19:54:42,443 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:42,443 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:42,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1642053531, now seen corresponding path program 3 times [2024-09-12 19:54:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110936191] [2024-09-12 19:54:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:42,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:42,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:54:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:42,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:42,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:42,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:42,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 11 proven. 275 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-09-12 19:54:43,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110936191] [2024-09-12 19:54:43,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110936191] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:43,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702601048] [2024-09-12 19:54:43,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:54:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:43,251 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:43,252 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 19:54:43,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-12 19:54:43,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:43,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 19:54:43,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-09-12 19:54:43,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-09-12 19:54:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702601048] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:47,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2024-09-12 19:54:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942790606] [2024-09-12 19:54:47,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:47,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-12 19:54:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:47,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-12 19:54:47,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=1751, Unknown=0, NotChecked=0, Total=2352 [2024-09-12 19:54:47,042 INFO L87 Difference]: Start difference. First operand 372 states and 392 transitions. Second operand has 49 states, 48 states have (on average 2.125) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (4), 1 states have call predecessors, (4), 24 states have return successors, (24), 24 states have call predecessors, (24), 1 states have call successors, (24) [2024-09-12 19:54:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:47,597 INFO L93 Difference]: Finished difference Result 1009 states and 1160 transitions. [2024-09-12 19:54:47,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-09-12 19:54:47,597 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (4), 1 states have call predecessors, (4), 24 states have return successors, (24), 24 states have call predecessors, (24), 1 states have call successors, (24) Word has length 118 [2024-09-12 19:54:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:47,601 INFO L225 Difference]: With dead ends: 1009 [2024-09-12 19:54:47,601 INFO L226 Difference]: Without dead ends: 432 [2024-09-12 19:54:47,605 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2024-09-12 19:54:47,605 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:47,606 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 91 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-09-12 19:54:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-09-12 19:54:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 348 states have (on average 1.0316091954022988) internal successors, (359), 339 states have internal predecessors, (359), 14 states have call successors, (14), 13 states have call predecessors, (14), 69 states have return successors, (79), 79 states have call predecessors, (79), 12 states have call successors, (79) [2024-09-12 19:54:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 452 transitions. [2024-09-12 19:54:47,663 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 452 transitions. Word has length 118 [2024-09-12 19:54:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:47,664 INFO L474 AbstractCegarLoop]: Abstraction has 432 states and 452 transitions. [2024-09-12 19:54:47,664 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (4), 1 states have call predecessors, (4), 24 states have return successors, (24), 24 states have call predecessors, (24), 1 states have call successors, (24) [2024-09-12 19:54:47,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 452 transitions. [2024-09-12 19:54:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-09-12 19:54:47,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:47,667 INFO L216 NwaCegarLoop]: trace histogram [35, 34, 34, 34, 34, 23, 23, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:47,679 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-12 19:54:47,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:47,868 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:47,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -865001913, now seen corresponding path program 4 times [2024-09-12 19:54:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:47,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22373279] [2024-09-12 19:54:47,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:47,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:48,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:48,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-12 19:54:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:48,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:48,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:49,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:49,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:49,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:49,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:49,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:50,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,063 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 34 proven. 1265 refuted. 0 times theorem prover too weak. 2839 trivial. 0 not checked. [2024-09-12 19:54:51,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22373279] [2024-09-12 19:54:51,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22373279] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:51,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570486794] [2024-09-12 19:54:51,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 19:54:51,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:51,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:51,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:54:51,354 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-12 19:54:51,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 19:54:51,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:51,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-09-12 19:54:51,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 1595 proven. 1344 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2024-09-12 19:54:52,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:55:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4138 backedges. 1595 proven. 2290 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-09-12 19:55:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570486794] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:55:35,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:55:35,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 51, 73] total 146 [2024-09-12 19:55:35,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213906713] [2024-09-12 19:55:35,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:55:35,671 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2024-09-12 19:55:35,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:55:35,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2024-09-12 19:55:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2199, Invalid=18971, Unknown=0, NotChecked=0, Total=21170 [2024-09-12 19:55:35,677 INFO L87 Difference]: Start difference. First operand 432 states and 452 transitions. Second operand has 146 states, 144 states have (on average 2.673611111111111) internal successors, (385), 122 states have internal predecessors, (385), 50 states have call successors, (53), 25 states have call predecessors, (53), 47 states have return successors, (70), 47 states have call predecessors, (70), 26 states have call successors, (70) [2024-09-12 19:55:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:55:36,207 INFO L93 Difference]: Finished difference Result 432 states and 452 transitions. [2024-09-12 19:55:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-12 19:55:36,208 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 144 states have (on average 2.673611111111111) internal successors, (385), 122 states have internal predecessors, (385), 50 states have call successors, (53), 25 states have call predecessors, (53), 47 states have return successors, (70), 47 states have call predecessors, (70), 26 states have call successors, (70) Word has length 293 [2024-09-12 19:55:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:55:36,210 INFO L225 Difference]: With dead ends: 432 [2024-09-12 19:55:36,210 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:55:36,217 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 513 SyntacticMatches, 23 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12821 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3033, Invalid=21773, Unknown=0, NotChecked=0, Total=24806 [2024-09-12 19:55:36,218 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:55:36,218 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 184 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:55:36,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:55:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:55:36,220 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 19:55:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:55:36,220 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2024-09-12 19:55:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:55:36,220 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:55:36,221 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 144 states have (on average 2.673611111111111) internal successors, (385), 122 states have internal predecessors, (385), 50 states have call successors, (53), 25 states have call predecessors, (53), 47 states have return successors, (70), 47 states have call predecessors, (70), 26 states have call successors, (70) [2024-09-12 19:55:36,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:55:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:55:36,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:55:36,224 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-12 19:55:36,224 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 19:55:36,224 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 19:55:36,224 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 19:55:36,225 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2024-09-12 19:55:36,238 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-12 19:55:36,425 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 19:55:36,429 INFO L408 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2024-09-12 19:55:36,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:55:40,380 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:55:40,401 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-12 19:55:40,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:55:40 BoogieIcfgContainer [2024-09-12 19:55:40,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:55:40,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:55:40,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:55:40,407 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:55:40,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:54:34" (3/4) ... [2024-09-12 19:55:40,409 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:55:40,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:55:40,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:55:40,416 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-09-12 19:55:40,418 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 19:55:40,418 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 19:55:40,418 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 19:55:40,419 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:55:40,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:55:40,491 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:55:40,491 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:55:40,491 INFO L158 Benchmark]: Toolchain (without parser) took 66690.55ms. Allocated memory was 67.1MB in the beginning and 662.7MB in the end (delta: 595.6MB). Free memory was 47.6MB in the beginning and 376.4MB in the end (delta: -328.8MB). Peak memory consumption was 266.9MB. Max. memory is 16.1GB. [2024-09-12 19:55:40,491 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 67.1MB. Free memory was 43.7MB in the beginning and 43.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:55:40,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.40ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 36.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 19:55:40,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.09ms. Allocated memory is still 67.1MB. Free memory was 36.5MB in the beginning and 35.5MB in the end (delta: 974.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:55:40,492 INFO L158 Benchmark]: Boogie Preprocessor took 29.75ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 34.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:55:40,492 INFO L158 Benchmark]: RCFGBuilder took 277.69ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 33.8MB in the beginning and 71.7MB in the end (delta: -37.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-12 19:55:40,493 INFO L158 Benchmark]: TraceAbstraction took 66068.78ms. Allocated memory was 96.5MB in the beginning and 662.7MB in the end (delta: 566.2MB). Free memory was 71.0MB in the beginning and 380.6MB in the end (delta: -309.6MB). Peak memory consumption was 341.7MB. Max. memory is 16.1GB. [2024-09-12 19:55:40,494 INFO L158 Benchmark]: Witness Printer took 84.21ms. Allocated memory is still 662.7MB. Free memory was 380.6MB in the beginning and 376.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 19:55:40,495 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.22ms. Allocated memory is still 67.1MB. Free memory was 43.7MB in the beginning and 43.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.40ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 36.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.09ms. Allocated memory is still 67.1MB. Free memory was 36.5MB in the beginning and 35.5MB in the end (delta: 974.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.75ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 34.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 277.69ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 33.8MB in the beginning and 71.7MB in the end (delta: -37.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 66068.78ms. Allocated memory was 96.5MB in the beginning and 662.7MB in the end (delta: 566.2MB). Free memory was 71.0MB in the beginning and 380.6MB in the end (delta: -309.6MB). Peak memory consumption was 341.7MB. Max. memory is 16.1GB. * Witness Printer took 84.21ms. Allocated memory is still 662.7MB. Free memory was 380.6MB in the beginning and 376.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 8]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 62.0s, OverallIterations: 13, TraceHistogramMax: 35, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 882 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 826 mSDsluCounter, 1602 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1340 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2532 IncrementalHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 262 mSDtfsCounter, 2532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1845 GetRequests, 1361 SyntacticMatches, 23 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17823 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=12, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 327 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 55.9s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1425 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2215 ConstructedInterpolants, 0 QuantifiedInterpolants, 5739 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1329 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 9298/16285 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 5 specifications checked. All of them hold - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id. Requires: ((0 <= \old(x)) && (\old(x) <= 5)) Ensures: ((0 < \old(x)) || ((\result == 0) && (\old(x) == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-12 19:55:40,529 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