./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i10_o10-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_i10_o10-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 3f8ee4f5181b3404c1367dbf131683f1e761cea6b176154f687b628466c991fe --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:19,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:54:19,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:54:19,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:54:19,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:54:19,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:54:19,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:54:19,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:54:19,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:54:19,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:54:19,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:54:19,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:54:19,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:54:19,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:54:19,577 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:54:19,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:54:19,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:54:19,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:54:19,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:54:19,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:54:19,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:54:19,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:54:19,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:54:19,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:54:19,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:54:19,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:54:19,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:54:19,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:54:19,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:54:19,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:54:19,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:54:19,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:54:19,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:54:19,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:54:19,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:54:19,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:54:19,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:54:19,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:54:19,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:54:19,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:54:19,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:54:19,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:54:19,585 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 -> 3f8ee4f5181b3404c1367dbf131683f1e761cea6b176154f687b628466c991fe 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:19,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:54:19,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:54:19,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:54:19,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:54:19,873 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:54:19,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2024-09-12 19:54:21,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:54:21,612 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:54:21,613 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2024-09-12 19:54:21,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/2b9619c3c/301624acaa1f4d039d813759128602af/FLAG7ea8f7501 [2024-09-12 19:54:21,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/2b9619c3c/301624acaa1f4d039d813759128602af [2024-09-12 19:54:21,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:54:21,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:54:21,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:54:21,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:54:21,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:54:21,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:54:21" (1/1) ... [2024-09-12 19:54:21,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a14991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:21, skipping insertion in model container [2024-09-12 19:54:21,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:54:21" (1/1) ... [2024-09-12 19:54:21,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:54:21,786 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_i10_o10-2.c[454,467] [2024-09-12 19:54:21,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:54:21,820 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:54:21,837 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_i10_o10-2.c[454,467] [2024-09-12 19:54:21,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:54:21,851 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:54:21,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:21 WrapperNode [2024-09-12 19:54:21,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:54:21,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:54:21,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:54:21,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:54:21,859 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:21" (1/1) ... [2024-09-12 19:54:21,862 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:21" (1/1) ... [2024-09-12 19:54:21,867 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:54:21,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:54:21,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:54:21,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:54:21,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:54:21,876 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:21" (1/1) ... [2024-09-12 19:54:21,876 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:21" (1/1) ... [2024-09-12 19:54:21,877 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:21" (1/1) ... [2024-09-12 19:54:21,885 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:21,888 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:21" (1/1) ... [2024-09-12 19:54:21,888 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:21" (1/1) ... [2024-09-12 19:54:21,890 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:21" (1/1) ... [2024-09-12 19:54:21,891 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:21" (1/1) ... [2024-09-12 19:54:21,892 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:21" (1/1) ... [2024-09-12 19:54:21,892 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:21" (1/1) ... [2024-09-12 19:54:21,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:54:21,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:54:21,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:54:21,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:54:21,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:21" (1/1) ... [2024-09-12 19:54:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:54:21,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:21,927 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:21,941 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:21,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:54:22,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:54:22,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:54:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:54:22,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:54:22,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:54:22,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:54:22,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:54:22,010 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-12 19:54:22,010 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-12 19:54:22,078 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:54:22,083 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:54:22,286 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-12 19:54:22,286 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:54:22,320 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:54:22,320 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:54:22,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:54:22 BoogieIcfgContainer [2024-09-12 19:54:22,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:54:22,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:54:22,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:54:22,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:54:22,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:54:21" (1/3) ... [2024-09-12 19:54:22,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a321ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:54:22, skipping insertion in model container [2024-09-12 19:54:22,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:54:21" (2/3) ... [2024-09-12 19:54:22,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a321ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:54:22, skipping insertion in model container [2024-09-12 19:54:22,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:54:22" (3/3) ... [2024-09-12 19:54:22,334 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2024-09-12 19:54:22,356 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:54:22,357 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-12 19:54:22,444 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:54:22,458 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;@7ff09fb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:54:22,459 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-12 19:54:22,466 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:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-12 19:54:22,475 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:22,479 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:22,480 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:22,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash 697441800, now seen corresponding path program 1 times [2024-09-12 19:54:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:22,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210173608] [2024-09-12 19:54:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:22,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:22,732 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:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210173608] [2024-09-12 19:54:22,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210173608] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:22,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:22,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:54:22,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591682055] [2024-09-12 19:54:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:22,738 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:54:22,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:54:22,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:54:22,758 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:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:22,844 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-09-12 19:54:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:54:22,846 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:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:22,851 INFO L225 Difference]: With dead ends: 52 [2024-09-12 19:54:22,851 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 19:54:22,853 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:22,857 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:22,858 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:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 19:54:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-09-12 19:54:22,892 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:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-12 19:54:22,896 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2024-09-12 19:54:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:22,897 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-12 19:54:22,897 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:22,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-12 19:54:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 19:54:22,899 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:22,899 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:22,899 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:54:22,900 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:22,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash 145859376, now seen corresponding path program 1 times [2024-09-12 19:54:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:22,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141811972] [2024-09-12 19:54:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:22,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:22,981 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:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141811972] [2024-09-12 19:54:22,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141811972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:22,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:22,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:54:22,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287319772] [2024-09-12 19:54:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:22,985 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:54:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:54:22,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:54:22,987 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:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:23,041 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-09-12 19:54:23,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:54:23,041 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:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:23,043 INFO L225 Difference]: With dead ends: 36 [2024-09-12 19:54:23,043 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 19:54:23,043 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:23,046 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:23,047 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:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 19:54:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-12 19:54:23,063 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:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-09-12 19:54:23,064 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 10 [2024-09-12 19:54:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:23,065 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-09-12 19:54:23,065 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:23,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-09-12 19:54:23,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 19:54:23,066 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:23,067 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:23,067 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:54:23,067 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:23,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1139611612, now seen corresponding path program 1 times [2024-09-12 19:54:23,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:23,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942307926] [2024-09-12 19:54:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:23,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,149 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:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942307926] [2024-09-12 19:54:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942307926] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597149965] [2024-09-12 19:54:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:23,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:23,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:23,152 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:23,153 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:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 19:54:23,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:23,227 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:23,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:23,289 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:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597149965] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:23,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-09-12 19:54:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598875193] [2024-09-12 19:54:23,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:23,291 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 19:54:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:23,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 19:54:23,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:54:23,292 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:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:23,433 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-09-12 19:54:23,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:54:23,434 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:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:23,435 INFO L225 Difference]: With dead ends: 91 [2024-09-12 19:54:23,435 INFO L226 Difference]: Without dead ends: 77 [2024-09-12 19:54:23,435 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:23,439 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:23,440 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:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-12 19:54:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2024-09-12 19:54:23,459 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:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-09-12 19:54:23,465 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 14 [2024-09-12 19:54:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:23,466 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-09-12 19:54:23,467 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:23,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-09-12 19:54:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 19:54:23,468 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:23,468 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:23,485 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:23,669 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:23,669 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:23,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,670 INFO L85 PathProgramCache]: Analyzing trace with hash 482378263, now seen corresponding path program 1 times [2024-09-12 19:54:23,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289322160] [2024-09-12 19:54:23,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,723 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 19:54:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,760 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:23,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289322160] [2024-09-12 19:54:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289322160] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:23,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:54:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842881722] [2024-09-12 19:54:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:23,761 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:54:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:54:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:54:23,762 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:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:23,831 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2024-09-12 19:54:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:54:23,831 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:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:23,833 INFO L225 Difference]: With dead ends: 83 [2024-09-12 19:54:23,836 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 19:54:23,836 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:23,837 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:23,837 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:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 19:54:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-12 19:54:23,852 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:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-09-12 19:54:23,856 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 22 [2024-09-12 19:54:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:23,856 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-09-12 19:54:23,857 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:23,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,857 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-09-12 19:54:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:54:23,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:23,861 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:23,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:54:23,861 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:23,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -603481423, now seen corresponding path program 1 times [2024-09-12 19:54:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:23,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589985248] [2024-09-12 19:54:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 19:54:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:23,898 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:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589985248] [2024-09-12 19:54:23,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589985248] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:23,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:54:23,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:54:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867649038] [2024-09-12 19:54:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:23,900 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:54:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:54:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:54:23,901 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:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:23,916 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2024-09-12 19:54:23,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:54:23,916 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:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:23,917 INFO L225 Difference]: With dead ends: 81 [2024-09-12 19:54:23,917 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 19:54:23,917 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:23,918 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:23,918 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:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 19:54:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-09-12 19:54:23,944 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:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-09-12 19:54:23,945 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 27 [2024-09-12 19:54:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:23,945 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-09-12 19:54:23,945 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:23,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-09-12 19:54:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 19:54:23,946 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:23,947 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:23,947 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:54:23,947 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:23,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1734641416, now seen corresponding path program 2 times [2024-09-12 19:54:23,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:23,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053970630] [2024-09-12 19:54:23,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:23,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:24,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:24,122 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:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053970630] [2024-09-12 19:54:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053970630] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:24,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57057278] [2024-09-12 19:54:24,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:54:24,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:24,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:24,126 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:24,141 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:24,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:54:24,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:24,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 19:54:24,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:24,221 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:24,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:24,396 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:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57057278] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:24,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-09-12 19:54:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119301245] [2024-09-12 19:54:24,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:24,397 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 19:54:24,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:24,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 19:54:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-09-12 19:54:24,398 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:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:24,780 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2024-09-12 19:54:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-12 19:54:24,780 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:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:24,782 INFO L225 Difference]: With dead ends: 203 [2024-09-12 19:54:24,782 INFO L226 Difference]: Without dead ends: 165 [2024-09-12 19:54:24,782 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:24,783 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 227 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:24,783 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:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-09-12 19:54:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2024-09-12 19:54:24,806 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:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2024-09-12 19:54:24,807 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 29 [2024-09-12 19:54:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:24,808 INFO L474 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2024-09-12 19:54:24,808 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:24,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2024-09-12 19:54:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 19:54:24,809 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:24,809 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:24,824 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:25,013 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:25,014 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:25,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:25,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2132070951, now seen corresponding path program 1 times [2024-09-12 19:54:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:25,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878742699] [2024-09-12 19:54:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:25,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:25,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:54:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:25,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:25,215 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:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878742699] [2024-09-12 19:54:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878742699] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055032036] [2024-09-12 19:54:25,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:25,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:25,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:25,217 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:25,218 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:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:25,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:54:25,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:54:25,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:54:25,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055032036] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:25,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 30 [2024-09-12 19:54:25,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679961123] [2024-09-12 19:54:25,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:25,686 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-12 19:54:25,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:25,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-12 19:54:25,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2024-09-12 19:54:25,688 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand has 30 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 22 states have internal predecessors, (69), 13 states have call successors, (16), 9 states have call predecessors, (16), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-12 19:54:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:26,019 INFO L93 Difference]: Finished difference Result 223 states and 242 transitions. [2024-09-12 19:54:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 19:54:26,020 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 22 states have internal predecessors, (69), 13 states have call successors, (16), 9 states have call predecessors, (16), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2024-09-12 19:54:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:26,021 INFO L225 Difference]: With dead ends: 223 [2024-09-12 19:54:26,021 INFO L226 Difference]: Without dead ends: 151 [2024-09-12 19:54:26,022 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 19:54:26,022 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 213 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:26,022 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 428 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:54:26,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-09-12 19:54:26,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2024-09-12 19:54:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.117117117117117) internal successors, (124), 111 states have internal predecessors, (124), 14 states have call successors, (14), 13 states have call predecessors, (14), 15 states have return successors, (18), 18 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-12 19:54:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-09-12 19:54:26,041 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 43 [2024-09-12 19:54:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:26,041 INFO L474 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-09-12 19:54:26,042 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 22 states have internal predecessors, (69), 13 states have call successors, (16), 9 states have call predecessors, (16), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-09-12 19:54:26,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-09-12 19:54:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 19:54:26,043 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:26,043 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:26,058 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:26,247 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:26,248 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:26,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1956580216, now seen corresponding path program 3 times [2024-09-12 19:54:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838882142] [2024-09-12 19:54:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:26,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:26,544 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:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838882142] [2024-09-12 19:54:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838882142] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832139482] [2024-09-12 19:54:26,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:54:26,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:26,546 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:26,547 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:26,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-12 19:54:26,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:26,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-12 19:54:26,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:26,640 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:26,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:27,152 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:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832139482] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:27,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:27,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-09-12 19:54:27,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724856169] [2024-09-12 19:54:27,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:27,153 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-12 19:54:27,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:27,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-12 19:54:27,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 19:54:27,154 INFO L87 Difference]: Start difference. First operand 143 states and 156 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:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:27,450 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2024-09-12 19:54:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-12 19:54:27,450 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:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:27,452 INFO L225 Difference]: With dead ends: 153 [2024-09-12 19:54:27,452 INFO L226 Difference]: Without dead ends: 152 [2024-09-12 19:54:27,453 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1045, Invalid=2495, Unknown=0, NotChecked=0, Total=3540 [2024-09-12 19:54:27,453 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 292 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:27,454 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 413 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-09-12 19:54:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 142. [2024-09-12 19:54:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 110 states have internal predecessors, (123), 14 states have call successors, (14), 13 states have call predecessors, (14), 15 states have return successors, (18), 18 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-12 19:54:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2024-09-12 19:54:27,468 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 59 [2024-09-12 19:54:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:27,469 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2024-09-12 19:54:27,469 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:27,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2024-09-12 19:54:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-12 19:54:27,471 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:27,471 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:27,484 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:27,674 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:27,675 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:27,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:27,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1828768455, now seen corresponding path program 2 times [2024-09-12 19:54:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:27,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541985912] [2024-09-12 19:54:27,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:27,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:27,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:54:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:27,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:27,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-09-12 19:54:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541985912] [2024-09-12 19:54:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541985912] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574302653] [2024-09-12 19:54:27,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:54:27,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:27,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:27,825 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:27,826 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:27,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:54:27,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:27,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:54:27,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 19:54:27,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 19:54:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574302653] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:28,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-09-12 19:54:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558465368] [2024-09-12 19:54:28,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:28,024 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 19:54:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 19:54:28,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-09-12 19:54:28,025 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 19:54:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:28,156 INFO L93 Difference]: Finished difference Result 245 states and 283 transitions. [2024-09-12 19:54:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 19:54:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-09-12 19:54:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:28,158 INFO L225 Difference]: With dead ends: 245 [2024-09-12 19:54:28,158 INFO L226 Difference]: Without dead ends: 244 [2024-09-12 19:54:28,159 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-09-12 19:54:28,159 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:28,159 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 78 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-09-12 19:54:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-09-12 19:54:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 1.0615384615384615) internal successors, (207), 190 states have internal predecessors, (207), 14 states have call successors, (14), 13 states have call predecessors, (14), 33 states have return successors, (40), 40 states have call predecessors, (40), 13 states have call successors, (40) [2024-09-12 19:54:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 261 transitions. [2024-09-12 19:54:28,196 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 261 transitions. Word has length 73 [2024-09-12 19:54:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:28,197 INFO L474 AbstractCegarLoop]: Abstraction has 244 states and 261 transitions. [2024-09-12 19:54:28,197 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2024-09-12 19:54:28,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 261 transitions. [2024-09-12 19:54:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-12 19:54:28,199 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:28,199 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:28,215 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:28,402 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:28,403 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:28,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash -930534841, now seen corresponding path program 3 times [2024-09-12 19:54:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:28,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086542497] [2024-09-12 19:54:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:54:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 10 proven. 105 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-09-12 19:54:28,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:28,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086542497] [2024-09-12 19:54:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086542497] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:28,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280211520] [2024-09-12 19:54:28,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:54:28,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:28,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:28,724 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:28,729 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:28,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-12 19:54:28,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:28,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 19:54:28,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 19:54:28,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 19:54:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280211520] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:29,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2024-09-12 19:54:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535904550] [2024-09-12 19:54:29,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:29,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-12 19:54:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-12 19:54:29,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 19:54:29,851 INFO L87 Difference]: Start difference. First operand 244 states and 261 transitions. Second operand has 33 states, 32 states have (on average 2.1875) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (4), 1 states have call predecessors, (4), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-09-12 19:54:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:30,206 INFO L93 Difference]: Finished difference Result 647 states and 753 transitions. [2024-09-12 19:54:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-12 19:54:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (4), 1 states have call predecessors, (4), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 93 [2024-09-12 19:54:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:30,209 INFO L225 Difference]: With dead ends: 647 [2024-09-12 19:54:30,209 INFO L226 Difference]: Without dead ends: 646 [2024-09-12 19:54:30,211 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=720, Invalid=2820, Unknown=0, NotChecked=0, Total=3540 [2024-09-12 19:54:30,211 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:30,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 87 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:54:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-09-12 19:54:30,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 446. [2024-09-12 19:54:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 359 states have (on average 1.033426183844011) internal successors, (371), 350 states have internal predecessors, (371), 14 states have call successors, (14), 13 states have call predecessors, (14), 71 states have return successors, (86), 82 states have call predecessors, (86), 13 states have call successors, (86) [2024-09-12 19:54:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 471 transitions. [2024-09-12 19:54:30,289 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 471 transitions. Word has length 93 [2024-09-12 19:54:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:30,289 INFO L474 AbstractCegarLoop]: Abstraction has 446 states and 471 transitions. [2024-09-12 19:54:30,289 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.1875) internal successors, (70), 33 states have internal predecessors, (70), 1 states have call successors, (4), 1 states have call predecessors, (4), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2024-09-12 19:54:30,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 471 transitions. [2024-09-12 19:54:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-09-12 19:54:30,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:30,291 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:30,307 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:30,495 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:30,496 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:30,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash 530943925, now seen corresponding path program 1 times [2024-09-12 19:54:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:30,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781848316] [2024-09-12 19:54:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:30,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:30,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:54:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:30,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:30,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:30,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 10 proven. 245 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-09-12 19:54:31,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:31,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781848316] [2024-09-12 19:54:31,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781848316] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:31,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877660471] [2024-09-12 19:54:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:31,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:31,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:31,334 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:31,336 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:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:31,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-12 19:54:31,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 19:54:31,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 19:54:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877660471] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:31,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2024-09-12 19:54:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999293295] [2024-09-12 19:54:31,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:31,882 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-12 19:54:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:31,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-12 19:54:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2024-09-12 19:54:31,882 INFO L87 Difference]: Start difference. First operand 446 states and 471 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) [2024-09-12 19:54:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:32,566 INFO L93 Difference]: Finished difference Result 620 states and 644 transitions. [2024-09-12 19:54:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-12 19:54:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2024-09-12 19:54:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:32,569 INFO L225 Difference]: With dead ends: 620 [2024-09-12 19:54:32,569 INFO L226 Difference]: Without dead ends: 566 [2024-09-12 19:54:32,570 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2024-09-12 19:54:32,570 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 48 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:32,570 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 483 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:54:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-09-12 19:54:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 446. [2024-09-12 19:54:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 359 states have (on average 1.033426183844011) internal successors, (371), 350 states have internal predecessors, (371), 14 states have call successors, (14), 13 states have call predecessors, (14), 71 states have return successors, (85), 82 states have call predecessors, (85), 13 states have call successors, (85) [2024-09-12 19:54:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 470 transitions. [2024-09-12 19:54:32,616 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 470 transitions. Word has length 113 [2024-09-12 19:54:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:32,616 INFO L474 AbstractCegarLoop]: Abstraction has 446 states and 470 transitions. [2024-09-12 19:54:32,616 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) [2024-09-12 19:54:32,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:32,617 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 470 transitions. [2024-09-12 19:54:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-12 19:54:32,618 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:32,618 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:32,631 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 19:54:32,822 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:32,823 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-09-12 19:54:32,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash -348749945, now seen corresponding path program 2 times [2024-09-12 19:54:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248989109] [2024-09-12 19:54:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:32,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:32,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:54:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 275 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-09-12 19:54:33,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:33,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248989109] [2024-09-12 19:54:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248989109] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930248433] [2024-09-12 19:54:33,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:54:33,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:33,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:33,482 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:33,483 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:33,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:54:33,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:33,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-12 19:54:33,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-09-12 19:54:33,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:54:33,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930248433] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:54:33,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:54:33,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 19 [2024-09-12 19:54:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153383883] [2024-09-12 19:54:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:54:33,692 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 19:54:33,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:33,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 19:54:33,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-09-12 19:54:33,693 INFO L87 Difference]: Start difference. First operand 446 states and 470 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-12 19:54:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:33,886 INFO L93 Difference]: Finished difference Result 566 states and 590 transitions. [2024-09-12 19:54:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 19:54:33,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2024-09-12 19:54:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:33,888 INFO L225 Difference]: With dead ends: 566 [2024-09-12 19:54:33,888 INFO L226 Difference]: Without dead ends: 392 [2024-09-12 19:54:33,889 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2024-09-12 19:54:33,889 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:33,890 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 190 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:54:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-09-12 19:54:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-09-12 19:54:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 316 states have (on average 1.0348101265822784) internal successors, (327), 307 states have internal predecessors, (327), 14 states have call successors, (14), 13 states have call predecessors, (14), 61 states have return successors, (71), 71 states have call predecessors, (71), 12 states have call successors, (71) [2024-09-12 19:54:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 412 transitions. [2024-09-12 19:54:33,939 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 412 transitions. Word has length 123 [2024-09-12 19:54:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:33,939 INFO L474 AbstractCegarLoop]: Abstraction has 392 states and 412 transitions. [2024-09-12 19:54:33,939 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-12 19:54:33,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 412 transitions. [2024-09-12 19:54:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-09-12 19:54:33,941 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:54:33,941 INFO L216 NwaCegarLoop]: trace histogram [27, 26, 26, 26, 26, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:54:33,954 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-12 19:54:34,145 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:34,146 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:34,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1717456199, now seen corresponding path program 4 times [2024-09-12 19:54:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:54:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901526674] [2024-09-12 19:54:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:54:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:54:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:54:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-12 19:54:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:34,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-12 19:54:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:54:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2202 backedges. 26 proven. 525 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2024-09-12 19:54:35,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:54:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901526674] [2024-09-12 19:54:35,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901526674] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:54:35,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991767392] [2024-09-12 19:54:35,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 19:54:35,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:54:35,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:54:35,337 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:35,346 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:35,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 19:54:35,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:54:35,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-09-12 19:54:35,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:54:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2202 backedges. 855 proven. 864 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-09-12 19:54:36,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:54:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2202 backedges. 855 proven. 1242 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-09-12 19:54:48,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991767392] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:54:48,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:54:48,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 43, 57] total 114 [2024-09-12 19:54:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910326034] [2024-09-12 19:54:48,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:54:48,792 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 114 states [2024-09-12 19:54:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:54:48,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2024-09-12 19:54:48,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=11499, Unknown=0, NotChecked=0, Total=12882 [2024-09-12 19:54:48,796 INFO L87 Difference]: Start difference. First operand 392 states and 412 transitions. Second operand has 114 states, 112 states have (on average 2.580357142857143) internal successors, (289), 90 states have internal predecessors, (289), 42 states have call successors, (45), 25 states have call predecessors, (45), 31 states have return successors, (46), 31 states have call predecessors, (46), 18 states have call successors, (46) [2024-09-12 19:54:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:54:49,365 INFO L93 Difference]: Finished difference Result 396 states and 416 transitions. [2024-09-12 19:54:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-12 19:54:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 114 states, 112 states have (on average 2.580357142857143) internal successors, (289), 90 states have internal predecessors, (289), 42 states have call successors, (45), 25 states have call predecessors, (45), 31 states have return successors, (46), 31 states have call predecessors, (46), 18 states have call successors, (46) Word has length 213 [2024-09-12 19:54:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:54:49,368 INFO L225 Difference]: With dead ends: 396 [2024-09-12 19:54:49,368 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:54:49,372 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 361 SyntacticMatches, 15 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7914 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2121, Invalid=13629, Unknown=0, NotChecked=0, Total=15750 [2024-09-12 19:54:49,373 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:54:49,374 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 202 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:54:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:54:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:54:49,374 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:54:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:54:49,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2024-09-12 19:54:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:54:49,375 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:54:49,375 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 114 states, 112 states have (on average 2.580357142857143) internal successors, (289), 90 states have internal predecessors, (289), 42 states have call successors, (45), 25 states have call predecessors, (45), 31 states have return successors, (46), 31 states have call predecessors, (46), 18 states have call successors, (46) [2024-09-12 19:54:49,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:54:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:54:49,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:54:49,379 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-12 19:54:49,379 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-09-12 19:54:49,379 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-09-12 19:54:49,379 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-09-12 19:54:49,379 INFO L785 garLoopResultBuilder]: Registering result SAFE for location idErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2024-09-12 19:54:49,391 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:54:49,580 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:54:49,583 INFO L408 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1] [2024-09-12 19:54:49,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:54:54,446 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:54:54,478 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-12 19:54:54,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:54:54 BoogieIcfgContainer [2024-09-12 19:54:54,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:54:54,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:54:54,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:54:54,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:54:54,484 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:22" (3/4) ... [2024-09-12 19:54:54,485 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:54:54,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:54:54,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:54:54,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-09-12 19:54:54,490 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-12 19:54:54,491 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 19:54:54,491 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 19:54:54,491 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:54:54,548 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:54:54,548 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:54:54,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:54:54,549 INFO L158 Benchmark]: Toolchain (without parser) took 32911.61ms. Allocated memory was 88.1MB in the beginning and 625.0MB in the end (delta: 536.9MB). Free memory was 52.2MB in the beginning and 572.9MB in the end (delta: -520.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,549 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:54:54,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.40ms. Allocated memory is still 88.1MB. Free memory was 51.9MB in the beginning and 66.7MB in the end (delta: -14.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 13.90ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 65.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,550 INFO L158 Benchmark]: Boogie Preprocessor took 26.09ms. Allocated memory is still 88.1MB. Free memory was 65.5MB in the beginning and 64.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,550 INFO L158 Benchmark]: RCFGBuilder took 425.64ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 52.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,550 INFO L158 Benchmark]: TraceAbstraction took 32158.68ms. Allocated memory was 88.1MB in the beginning and 625.0MB in the end (delta: 536.9MB). Free memory was 52.0MB in the beginning and 578.1MB in the end (delta: -526.2MB). Peak memory consumption was 363.2MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,551 INFO L158 Benchmark]: Witness Printer took 67.81ms. Allocated memory is still 625.0MB. Free memory was 577.1MB in the beginning and 572.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 19:54:54,552 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.16ms. Allocated memory is still 88.1MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.40ms. Allocated memory is still 88.1MB. Free memory was 51.9MB in the beginning and 66.7MB in the end (delta: -14.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 13.90ms. Allocated memory is still 88.1MB. Free memory was 66.6MB in the beginning and 65.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.09ms. Allocated memory is still 88.1MB. Free memory was 65.5MB in the beginning and 64.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.64ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 52.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 32158.68ms. Allocated memory was 88.1MB in the beginning and 625.0MB in the end (delta: 536.9MB). Free memory was 52.0MB in the beginning and 578.1MB in the end (delta: -526.2MB). Peak memory consumption was 363.2MB. Max. memory is 16.1GB. * Witness Printer took 67.81ms. Allocated memory is still 625.0MB. Free memory was 577.1MB in the beginning and 572.9MB 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: 27.2s, OverallIterations: 13, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1144 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1096 mSDsluCounter, 2502 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2146 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3877 IncrementalHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 356 mSDtfsCounter, 3877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1802 GetRequests, 1348 SyntacticMatches, 17 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10892 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=10, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 367 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 1588 NumberOfCodeBlocks, 1470 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 2195 ConstructedInterpolants, 0 QuantifiedInterpolants, 5343 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1384 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 7426/12211 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: ((((\old(x) == 0) || ((\old(x) <= 10) && (3 <= \old(x)))) || (\old(x) == 1)) || (\old(x) == 2)) Ensures: ((0 < \old(x)) || ((\result == 0) && (\old(x) == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-12 19:54:54,574 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