./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Addition01-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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/Addition01-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 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:04:26,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:04:26,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:04:26,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:04:26,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:04:26,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:04:26,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:04:26,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:04:26,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:04:26,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:04:26,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:04:26,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:04:26,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:04:26,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:04:26,796 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:04:26,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:04:26,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:04:26,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:04:26,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:04:26,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:04:26,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:04:26,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:04:26,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:04:26,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:04:26,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:04:26,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:04:26,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:04:26,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:04:26,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:04:26,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:04:26,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:04:26,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:04:26,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:04:26,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:04:26,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:04:26,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:04:26,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:04:26,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:04:26,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:04:26,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:04:26,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:04:26,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:04:26,813 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 -> 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 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.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:04:27,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:04:27,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:04:27,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:04:27,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:04:27,092 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:04:27,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Addition01-2.c [2024-09-25 00:04:28,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:04:28,789 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:04:28,789 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Addition01-2.c [2024-09-25 00:04:28,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fad9f697a/8b013289826c4cdbae1248f85640067b/FLAG667db619f [2024-09-25 00:04:28,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fad9f697a/8b013289826c4cdbae1248f85640067b [2024-09-25 00:04:28,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:04:28,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:04:28,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:04:28,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:04:28,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:04:28,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:04:28" (1/1) ... [2024-09-25 00:04:28,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a68712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:28, skipping insertion in model container [2024-09-25 00:04:28,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:04:28" (1/1) ... [2024-09-25 00:04:28,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:04:29,014 WARN L248 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/Addition01-2.c[1126,1139] [2024-09-25 00:04:29,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:04:29,031 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:04:29,044 WARN L248 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/Addition01-2.c[1126,1139] [2024-09-25 00:04:29,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:04:29,061 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:04:29,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29 WrapperNode [2024-09-25 00:04:29,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:04:29,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:04:29,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:04:29,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:04:29,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,083 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:04:29,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:04:29,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:04:29,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:04:29,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:04:29,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,095 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,106 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-25 00:04:29,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:04:29,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:04:29,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:04:29,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:04:29,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (1/1) ... [2024-09-25 00:04:29,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:04:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:29,145 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-25 00:04:29,152 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-25 00:04:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:04:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:04:29,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:04:29,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:04:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:04:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:04:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:04:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:04:29,194 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2024-09-25 00:04:29,194 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2024-09-25 00:04:29,261 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:04:29,263 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:04:29,434 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-25 00:04:29,435 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:04:29,454 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:04:29,454 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:04:29,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:04:29 BoogieIcfgContainer [2024-09-25 00:04:29,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:04:29,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:04:29,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:04:29,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:04:29,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:04:28" (1/3) ... [2024-09-25 00:04:29,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4d1aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:04:29, skipping insertion in model container [2024-09-25 00:04:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:29" (2/3) ... [2024-09-25 00:04:29,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4d1aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:04:29, skipping insertion in model container [2024-09-25 00:04:29,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:04:29" (3/3) ... [2024-09-25 00:04:29,463 INFO L112 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2024-09-25 00:04:29,477 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:04:29,478 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:04:29,530 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:04:29,536 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;@16739e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:04:29,537 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:04:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:04:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 00:04:29,553 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:29,554 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:29,555 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:29,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:29,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1172000137, now seen corresponding path program 1 times [2024-09-25 00:04:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808620538] [2024-09-25 00:04:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:29,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:29,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:04:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,067 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-25 00:04:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808620538] [2024-09-25 00:04:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808620538] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:04:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:04:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:04:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393048272] [2024-09-25 00:04:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:30,078 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:04:30,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:04:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:04:30,102 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 00:04:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:30,248 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-25 00:04:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:04:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-09-25 00:04:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:30,258 INFO L225 Difference]: With dead ends: 38 [2024-09-25 00:04:30,258 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 00:04:30,260 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:04:30,263 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:30,264 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:04:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 00:04:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-25 00:04:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 00:04:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-09-25 00:04:30,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2024-09-25 00:04:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:30,301 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-09-25 00:04:30,302 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 00:04:30,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-09-25 00:04:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 00:04:30,304 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:30,304 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:30,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:04:30,305 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:30,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1361011760, now seen corresponding path program 1 times [2024-09-25 00:04:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543287235] [2024-09-25 00:04:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:04:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,395 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-25 00:04:30,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:30,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543287235] [2024-09-25 00:04:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543287235] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:04:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:04:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 00:04:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642190924] [2024-09-25 00:04:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:30,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 00:04:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 00:04:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 00:04:30,399 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 00:04:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:30,433 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-25 00:04:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 00:04:30,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-25 00:04:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:30,434 INFO L225 Difference]: With dead ends: 34 [2024-09-25 00:04:30,435 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 00:04:30,435 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 00:04:30,436 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:30,437 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:04:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 00:04:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-25 00:04:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 00:04:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-25 00:04:30,446 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-09-25 00:04:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:30,447 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-25 00:04:30,447 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 00:04:30,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-25 00:04:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 00:04:30,449 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:30,449 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:30,449 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:04:30,450 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:30,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash 398114939, now seen corresponding path program 1 times [2024-09-25 00:04:30,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:30,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171761070] [2024-09-25 00:04:30,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:30,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:04:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:04:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:04:30,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:30,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171761070] [2024-09-25 00:04:30,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171761070] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:30,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147182192] [2024-09-25 00:04:30,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:30,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:30,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:30,899 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-25 00:04:30,902 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-25 00:04:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:30,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 00:04:30,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:04:31,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:04:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147182192] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:31,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:04:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 19 [2024-09-25 00:04:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057334809] [2024-09-25 00:04:31,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:31,582 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 00:04:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 00:04:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:04:31,586 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 00:04:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:31,831 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-09-25 00:04:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:04:31,832 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2024-09-25 00:04:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:31,833 INFO L225 Difference]: With dead ends: 38 [2024-09-25 00:04:31,833 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:04:31,834 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 00:04:31,835 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:31,835 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:04:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:04:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-09-25 00:04:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 00:04:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-25 00:04:31,845 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2024-09-25 00:04:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:31,845 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-25 00:04:31,845 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 00:04:31,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-25 00:04:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 00:04:31,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:31,851 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:31,870 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:04:32,055 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-25 00:04:32,056 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:32,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash -224719989, now seen corresponding path program 1 times [2024-09-25 00:04:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712400318] [2024-09-25 00:04:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:04:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:04:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:04:32,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:32,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712400318] [2024-09-25 00:04:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712400318] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:32,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442939494] [2024-09-25 00:04:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:32,136 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-25 00:04:32,137 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-25 00:04:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 00:04:32,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:04:32,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:04:32,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442939494] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:32,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:04:32,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-09-25 00:04:32,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711595038] [2024-09-25 00:04:32,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:32,294 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 00:04:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 00:04:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:04:32,295 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:04:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:32,351 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-09-25 00:04:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:04:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-09-25 00:04:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:32,353 INFO L225 Difference]: With dead ends: 33 [2024-09-25 00:04:32,353 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 00:04:32,353 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:04:32,354 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:32,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:04:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 00:04:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-25 00:04:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 00:04:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-09-25 00:04:32,368 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2024-09-25 00:04:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:32,368 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-09-25 00:04:32,368 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:04:32,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-09-25 00:04:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 00:04:32,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:32,370 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:32,389 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 00:04:32,570 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:32,571 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:32,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash -546907673, now seen corresponding path program 1 times [2024-09-25 00:04:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849207563] [2024-09-25 00:04:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 00:04:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:04:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:04:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:04:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849207563] [2024-09-25 00:04:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849207563] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735762820] [2024-09-25 00:04:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:32,695 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-25 00:04:32,698 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-25 00:04:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:32,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 00:04:32,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:04:32,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:04:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735762820] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:32,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:04:32,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-09-25 00:04:32,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005132986] [2024-09-25 00:04:32,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:32,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 00:04:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 00:04:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:04:32,877 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 00:04:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:32,929 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-25 00:04:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:04:32,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2024-09-25 00:04:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:32,930 INFO L225 Difference]: With dead ends: 32 [2024-09-25 00:04:32,930 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:04:32,931 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:04:32,932 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:32,932 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:04:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:04:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:04:32,933 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-25 00:04:32,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:04:32,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-09-25 00:04:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:32,934 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:04:32,934 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 00:04:32,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:04:32,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:04:32,937 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:04:32,952 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:04:33,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:33,145 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-25 00:04:33,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:04:33,465 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:04:33,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:04:33 BoogieIcfgContainer [2024-09-25 00:04:33,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:04:33,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:04:33,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:04:33,489 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:04:33,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:04:29" (3/4) ... [2024-09-25 00:04:33,491 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:04:33,543 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:04:33,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:04:33,544 INFO L158 Benchmark]: Toolchain (without parser) took 4728.32ms. Allocated memory was 125.8MB in the beginning and 209.7MB in the end (delta: 83.9MB). Free memory was 55.7MB in the beginning and 142.7MB in the end (delta: -87.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:04:33,544 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 85.4MB in the end (delta: 155.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:04:33,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.09ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 55.4MB in the beginning and 139.8MB in the end (delta: -84.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-09-25 00:04:33,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.98ms. Allocated memory is still 174.1MB. Free memory was 139.8MB in the beginning and 138.9MB in the end (delta: 951.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:04:33,545 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 174.1MB. Free memory was 138.9MB in the beginning and 137.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:04:33,545 INFO L158 Benchmark]: RCFGBuilder took 338.26ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 124.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:04:33,545 INFO L158 Benchmark]: TraceAbstraction took 4030.28ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 124.2MB in the beginning and 144.8MB in the end (delta: -20.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-09-25 00:04:33,547 INFO L158 Benchmark]: Witness Printer took 55.28ms. Allocated memory is still 209.7MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:04:33,548 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.11ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 85.4MB in the end (delta: 155.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.09ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 55.4MB in the beginning and 139.8MB in the end (delta: -84.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.98ms. Allocated memory is still 174.1MB. Free memory was 139.8MB in the beginning and 138.9MB in the end (delta: 951.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 174.1MB. Free memory was 138.9MB in the beginning and 137.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 338.26ms. Allocated memory is still 174.1MB. Free memory was 137.8MB in the beginning and 124.2MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4030.28ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 124.2MB in the beginning and 144.8MB in the end (delta: -20.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * Witness Printer took 55.28ms. Allocated memory is still 209.7MB. Free memory was 144.8MB in the beginning and 142.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 100 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 4 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 48/63 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 1 specifications checked. All of them hold - ProcedureContractResult [Line: 15]: Procedure Contract for addition Derived contract for procedure addition. Ensures: (((n < 0) || (\result == ((long long) n + m))) || ((n == 0) && (m == \result))) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:04:33,578 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE