./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --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/nla-digbench-scaling/divbin_valuebound1.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea97fe631de3abcfa1030cdb800e2845e2e97a42347e391a7c9fd401d3d0b815 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:51:57,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:51:57,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:51:57,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:51:57,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:51:57,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:51:57,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:51:57,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:51:57,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:51:57,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:51:57,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:51:57,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:51:57,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:51:57,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:51:57,130 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:51:57,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:51:57,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:51:57,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:51:57,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:51:57,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:51:57,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:51:57,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:51:57,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:51:57,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:51:57,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:51:57,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:51:57,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:51:57,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:51:57,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:51:57,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:51:57,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:51:57,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:51:57,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:51:57,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:51:57,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:51:57,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:51:57,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:51:57,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:51:57,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:51:57,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:51:57,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:51:57,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:51:57,138 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 -> ea97fe631de3abcfa1030cdb800e2845e2e97a42347e391a7c9fd401d3d0b815 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 [2024-09-12 15:51:57,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:51:57,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:51:57,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:51:57,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:51:57,432 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:51:57,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i [2024-09-12 15:51:58,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:51:58,866 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:51:58,867 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound1.i [2024-09-12 15:51:58,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/175bbcf92/70be8029e6074c90bd18af711bdef7d2/FLAG0f84e8240 [2024-09-12 15:51:58,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/175bbcf92/70be8029e6074c90bd18af711bdef7d2 [2024-09-12 15:51:58,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:51:58,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:51:58,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:51:58,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:51:58,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:51:58,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:51:58" (1/1) ... [2024-09-12 15:51:58,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76215220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:58, skipping insertion in model container [2024-09-12 15:51:58,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:51:58" (1/1) ... [2024-09-12 15:51:58,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:51:59,016 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/nla-digbench-scaling/divbin_valuebound1.i[950,963] [2024-09-12 15:51:59,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:51:59,035 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:51:59,043 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/nla-digbench-scaling/divbin_valuebound1.i[950,963] [2024-09-12 15:51:59,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:51:59,060 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:51:59,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59 WrapperNode [2024-09-12 15:51:59,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:51:59,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:51:59,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:51:59,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:51:59,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,079 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:51:59,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:51:59,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:51:59,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:51:59,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:51:59,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,115 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 15:51:59,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:51:59,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:51:59,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:51:59,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:51:59,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (1/1) ... [2024-09-12 15:51:59,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:51:59,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:51:59,175 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 15:51:59,183 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 15:51:59,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:51:59,213 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 15:51:59,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 15:51:59,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:51:59,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:51:59,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:51:59,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:51:59,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:51:59,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:51:59,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:51:59,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:51:59,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:51:59,265 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:51:59,267 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:51:59,389 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 15:51:59,389 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:51:59,410 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:51:59,410 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 15:51:59,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:51:59 BoogieIcfgContainer [2024-09-12 15:51:59,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:51:59,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:51:59,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:51:59,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:51:59,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:51:58" (1/3) ... [2024-09-12 15:51:59,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de0f11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:51:59, skipping insertion in model container [2024-09-12 15:51:59,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:51:59" (2/3) ... [2024-09-12 15:51:59,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de0f11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:51:59, skipping insertion in model container [2024-09-12 15:51:59,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:51:59" (3/3) ... [2024-09-12 15:51:59,419 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound1.i [2024-09-12 15:51:59,434 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:51:59,434 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:51:59,476 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:51:59,482 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;@792a2dde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:51:59,483 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:51:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:51:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 15:51:59,492 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:51:59,493 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:51:59,494 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:51:59,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:51:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -923394275, now seen corresponding path program 1 times [2024-09-12 15:51:59,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:51:59,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093480636] [2024-09-12 15:51:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:51:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:51:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:51:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:51:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:51:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:51:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 15:51:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:51:59,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:51:59,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093480636] [2024-09-12 15:51:59,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093480636] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:51:59,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:51:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 15:51:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706504934] [2024-09-12 15:51:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:51:59,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 15:51:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:51:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 15:51:59,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:51:59,693 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 15:51:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:51:59,715 INFO L93 Difference]: Finished difference Result 58 states and 87 transitions. [2024-09-12 15:51:59,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 15:51:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-12 15:51:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:51:59,724 INFO L225 Difference]: With dead ends: 58 [2024-09-12 15:51:59,724 INFO L226 Difference]: Without dead ends: 28 [2024-09-12 15:51:59,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:51:59,730 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:51:59,733 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:51:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-12 15:51:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-12 15:51:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 15:51:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-12 15:51:59,761 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 33 [2024-09-12 15:51:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:51:59,762 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-12 15:51:59,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 15:51:59,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:51:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-12 15:51:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 15:51:59,765 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:51:59,765 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:51:59,765 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:51:59,766 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:51:59,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:51:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1193042891, now seen corresponding path program 1 times [2024-09-12 15:51:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:51:59,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699918697] [2024-09-12 15:51:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:51:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:51:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:51:59,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283869773] [2024-09-12 15:51:59,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:51:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:51:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:51:59,840 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 15:51:59,841 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 15:51:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:51:59,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 15:51:59,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:52:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 15:52:00,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:52:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:52:00,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:52:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699918697] [2024-09-12 15:52:00,396 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:52:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283869773] [2024-09-12 15:52:00,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283869773] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 15:52:00,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:52:00,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-09-12 15:52:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861497629] [2024-09-12 15:52:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:52:00,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:52:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:52:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:52:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:52:00,399 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-12 15:52:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:52:00,803 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-09-12 15:52:00,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:52:00,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2024-09-12 15:52:00,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:52:00,806 INFO L225 Difference]: With dead ends: 40 [2024-09-12 15:52:00,806 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 15:52:00,808 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:52:00,809 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 15:52:00,810 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 15:52:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 15:52:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-12 15:52:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 15:52:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-09-12 15:52:00,823 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 34 [2024-09-12 15:52:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:52:00,825 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-09-12 15:52:00,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-12 15:52:00,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:00,827 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-09-12 15:52:00,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 15:52:00,828 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:52:00,828 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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-12 15:52:00,841 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 15:52:01,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:52:01,033 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:52:01,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 336856806, now seen corresponding path program 1 times [2024-09-12 15:52:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:52:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576899952] [2024-09-12 15:52:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:52:01,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:52:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:52:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698725975] [2024-09-12 15:52:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:52:01,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:52:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:52:01,074 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 15:52:01,075 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 15:52:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:01,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 15:52:01,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:52:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 15:52:01,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:52:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-12 15:52:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:52:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576899952] [2024-09-12 15:52:01,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:52:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698725975] [2024-09-12 15:52:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698725975] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 15:52:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:52:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2024-09-12 15:52:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789814913] [2024-09-12 15:52:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:52:01,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:52:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:52:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:52:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:52:01,491 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-12 15:52:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:52:02,260 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-09-12 15:52:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:52:02,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-09-12 15:52:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:52:02,261 INFO L225 Difference]: With dead ends: 47 [2024-09-12 15:52:02,261 INFO L226 Difference]: Without dead ends: 44 [2024-09-12 15:52:02,262 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:52:02,262 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 15:52:02,263 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 15:52:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-12 15:52:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2024-09-12 15:52:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 15:52:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-12 15:52:02,269 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 36 [2024-09-12 15:52:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:52:02,270 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-12 15:52:02,270 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-12 15:52:02,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-12 15:52:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 15:52:02,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:52:02,271 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:52:02,283 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-12 15:52:02,471 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:52:02,472 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:52:02,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 513117096, now seen corresponding path program 1 times [2024-09-12 15:52:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:52:02,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144709604] [2024-09-12 15:52:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:52:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:52:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:52:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:52:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:52:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:52:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 15:52:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-12 15:52:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 15:52:02,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:52:02,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144709604] [2024-09-12 15:52:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144709604] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:52:02,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:52:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 15:52:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469610394] [2024-09-12 15:52:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:52:02,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 15:52:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:52:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 15:52:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 15:52:02,888 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 15:52:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:52:02,920 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-09-12 15:52:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:52:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-12 15:52:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:52:02,922 INFO L225 Difference]: With dead ends: 51 [2024-09-12 15:52:02,922 INFO L226 Difference]: Without dead ends: 37 [2024-09-12 15:52:02,923 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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-12 15:52:02,923 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:52:02,924 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:52:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-12 15:52:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-12 15:52:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 15:52:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-12 15:52:02,936 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 42 [2024-09-12 15:52:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:52:02,936 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-12 15:52:02,937 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-12 15:52:02,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-12 15:52:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 15:52:02,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:52:02,939 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:52:02,939 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:52:02,939 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:52:02,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash 980542403, now seen corresponding path program 1 times [2024-09-12 15:52:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:52:02,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16235728] [2024-09-12 15:52:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:52:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:52:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:52:02,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168508156] [2024-09-12 15:52:02,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:52:02,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:52:02,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:52:02,971 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 15:52:02,971 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 15:52:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:03,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 15:52:03,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:52:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 15:52:03,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:52:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:52:35,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16235728] [2024-09-12 15:52:35,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:52:35,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168508156] [2024-09-12 15:52:35,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168508156] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:52:35,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:52:35,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-09-12 15:52:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394116142] [2024-09-12 15:52:35,491 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 15:52:35,491 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 15:52:35,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:52:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 15:52:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=193, Unknown=6, NotChecked=0, Total=240 [2024-09-12 15:52:35,492 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 15:52:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:52:35,623 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-12 15:52:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 15:52:35,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-09-12 15:52:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:52:35,624 INFO L225 Difference]: With dead ends: 52 [2024-09-12 15:52:35,624 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 15:52:35,624 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=47, Invalid=219, Unknown=6, NotChecked=0, Total=272 [2024-09-12 15:52:35,625 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:52:35,625 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:52:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 15:52:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-09-12 15:52:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-12 15:52:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-12 15:52:35,636 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 44 [2024-09-12 15:52:35,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:52:35,637 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-12 15:52:35,637 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 15:52:35,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-12 15:52:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-12 15:52:35,638 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:52:35,638 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:52:35,645 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-12 15:52:35,842 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-12 15:52:35,843 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:52:35,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2109238368, now seen corresponding path program 2 times [2024-09-12 15:52:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:52:35,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131682311] [2024-09-12 15:52:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:52:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:52:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:52:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:52:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 15:52:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 15:52:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 15:52:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 15:52:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 15:52:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:52:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 15:52:36,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:52:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131682311] [2024-09-12 15:52:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131682311] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:52:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455694662] [2024-09-12 15:52:36,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:52:36,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:52:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:52:36,238 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 15:52:36,239 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 15:52:36,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:52:36,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:52:36,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 15:52:36,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:52:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-12 15:52:36,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:52:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-12 15:52:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455694662] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:52:37,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:52:37,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 23 [2024-09-12 15:52:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906996244] [2024-09-12 15:52:37,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:52:37,464 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 15:52:37,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:52:37,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 15:52:37,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2024-09-12 15:52:37,465 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 19 states have internal predecessors, (47), 11 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-12 15:52:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:52:37,803 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2024-09-12 15:52:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 15:52:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 19 states have internal predecessors, (47), 11 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) Word has length 52 [2024-09-12 15:52:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:52:37,806 INFO L225 Difference]: With dead ends: 69 [2024-09-12 15:52:37,806 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:52:37,806 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2024-09-12 15:52:37,808 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:52:37,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 213 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:52:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:52:37,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:52:37,809 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 15:52:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:52:37,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-09-12 15:52:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:52:37,810 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:52:37,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 19 states have internal predecessors, (47), 11 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-12 15:52:37,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:52:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:52:37,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:52:37,812 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:52:37,822 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 15:52:38,012 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:52:38,016 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-09-12 15:52:38,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:52:46,906 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 68 DAG size of output: 67 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 15:52:51,893 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:52:51,906 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-12 15:52:51,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:52:51 BoogieIcfgContainer [2024-09-12 15:52:51,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:52:51,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:52:51,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:52:51,910 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:52:51,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:51:59" (3/4) ... [2024-09-12 15:52:51,911 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:52:51,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:52:51,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-12 15:52:51,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:52:51,914 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 15:52:51,916 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-12 15:52:51,916 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 15:52:51,917 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 15:52:51,917 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:52:51,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:52:51,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:52:51,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:52:51,975 INFO L158 Benchmark]: Toolchain (without parser) took 53087.72ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 57.4MB in the beginning and 137.3MB in the end (delta: -79.9MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-09-12 15:52:51,975 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 90.2MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:52:51,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.57ms. Allocated memory is still 90.2MB. Free memory was 57.1MB in the beginning and 45.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 15:52:51,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.47ms. Allocated memory is still 90.2MB. Free memory was 45.5MB in the beginning and 44.6MB in the end (delta: 988.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:52:51,976 INFO L158 Benchmark]: Boogie Preprocessor took 44.21ms. Allocated memory is still 90.2MB. Free memory was 44.3MB in the beginning and 42.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:52:51,976 INFO L158 Benchmark]: RCFGBuilder took 282.80ms. Allocated memory is still 90.2MB. Free memory was 42.7MB in the beginning and 58.3MB in the end (delta: -15.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2024-09-12 15:52:51,976 INFO L158 Benchmark]: TraceAbstraction took 52496.97ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 57.3MB in the beginning and 142.6MB in the end (delta: -85.2MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-09-12 15:52:51,976 INFO L158 Benchmark]: Witness Printer took 65.00ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 137.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:52:51,977 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17ms. Allocated memory is still 90.2MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.57ms. Allocated memory is still 90.2MB. Free memory was 57.1MB in the beginning and 45.5MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.47ms. Allocated memory is still 90.2MB. Free memory was 45.5MB in the beginning and 44.6MB in the end (delta: 988.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.21ms. Allocated memory is still 90.2MB. Free memory was 44.3MB in the beginning and 42.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 282.80ms. Allocated memory is still 90.2MB. Free memory was 42.7MB in the beginning and 58.3MB in the end (delta: -15.5MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * TraceAbstraction took 52496.97ms. Allocated memory was 90.2MB in the beginning and 174.1MB in the end (delta: 83.9MB). Free memory was 57.3MB in the beginning and 142.6MB in the end (delta: -85.2MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 65.00ms. Allocated memory is still 174.1MB. Free memory was 142.6MB in the beginning and 137.3MB in the end (delta: 5.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: 21]: 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 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.6s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 491 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 162 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 286 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, InterpolantAutomatonStates: 39, 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 35.3s InterpolantComputationTime, 407 NumberOfCodeBlocks, 407 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 405 ConstructedInterpolants, 4 QuantifiedInterpolants, 2519 SizeOfPredicates, 9 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 255/308 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 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((((B % 4294967296) == 1) && ((r % 4294967296) == (A % 4294967296))) && (0 <= ((2 * ((((-2147483648 * (b / 4294967296)) + (b / 2)) + ((long long) -1 * B)) / 4294967296)) + (b / 4294967296)))) && ((A % 4294967296) <= 1)) && (b <= ((long long) B * 2))) && (q == 0)) || (((((((B % 4294967296) == 1) && ((r % 4294967296) == (A % 4294967296))) && (((A / 4294967296) + (b / 4294967296)) <= ((r / 4294967296) + (B / 4294967296)))) && ((A % 4294967296) <= 1)) && (B == b)) && (q == 0))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((B % 4294967296) == 1) && (b == 1)) && ((r % 4294967296) <= 0)) && ((r % 4294967296) == (A % 4294967296))) && (q == 0)) || (((((((B % 4294967296) == 1) && ((r % 4294967296) == (A % 4294967296))) && (0 <= ((2 * ((((-2147483648 * (b / 4294967296)) + (b / 2)) + ((long long) -1 * B)) / 4294967296)) + (b / 4294967296)))) && ((A % 4294967296) <= 1)) && (b <= ((long long) B * 2))) && (q == 0))) || ((((((B % 4294967296) == 1) && (b == 1)) && ((r % 4294967296) <= 0)) && ((A % 4294967296) == (((long long) r + 1) % 4294967296))) && (q == 1))) || (((((b + ((B / 4294967296) * 4294967296)) == (B + ((b / 4294967296) * 4294967296))) && ((B / 4294967296) <= (b / 4294967296))) && (((A / 4294967296) + (b / 4294967296)) <= ((r / 4294967296) + (B / 4294967296)))) && ((A % 4294967296) == ((r + ((unsigned long long) b * q)) % 4294967296)))) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:52:52,027 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