./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_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 09575df3d22e9082519fef8b3f639469f79418a93deb54dd64ac9991de61e42a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:44:51,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:44:52,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:44:52,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:44:52,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:44:52,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:44:52,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:44:52,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:44:52,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:44:52,117 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:44:52,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:44:52,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:44:52,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:44:52,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:44:52,121 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:44:52,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:44:52,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:44:52,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:44:52,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:44:52,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:44:52,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:44:52,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:44:52,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:44:52,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:44:52,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:44:52,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:44:52,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:44:52,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:44:52,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:44:52,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:44:52,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:44:52,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:44:52,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:44:52,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:44:52,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:44:52,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:44:52,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:44:52,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:44:52,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:44:52,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:44:52,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:44:52,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:44:52,134 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 -> 09575df3d22e9082519fef8b3f639469f79418a93deb54dd64ac9991de61e42a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:44:52,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:44:52,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:44:52,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:44:52,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:44:52,501 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:44:52,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound1.i [2024-09-12 18:44:54,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:44:54,278 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:44:54,279 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound1.i [2024-09-12 18:44:54,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7c85e78c9/5f6bededb73c4fc98ca5001519307934/FLAGccc2b9b5b [2024-09-12 18:44:54,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7c85e78c9/5f6bededb73c4fc98ca5001519307934 [2024-09-12 18:44:54,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:44:54,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:44:54,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:44:54,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:44:54,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:44:54,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26458f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54, skipping insertion in model container [2024-09-12 18:44:54,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:44:54,831 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/divbin2_valuebound1.i[951,964] [2024-09-12 18:44:54,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:44:54,865 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:44:54,877 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/divbin2_valuebound1.i[951,964] [2024-09-12 18:44:54,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:44:54,899 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:44:54,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54 WrapperNode [2024-09-12 18:44:54,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:44:54,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:44:54,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:44:54,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:44:54,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,920 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:44:54,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:44:54,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:44:54,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:44:54,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:44:54,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,947 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 18:44:54,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:44:54,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:44:54,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:44:54,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:44:54,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (1/1) ... [2024-09-12 18:44:54,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:44:54,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:44:54,998 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 18:44:55,004 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 18:44:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:44:55,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 18:44:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 18:44:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:44:55,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:44:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:44:55,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:44:55,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:44:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:44:55,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:44:55,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 18:44:55,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 18:44:55,120 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:44:55,122 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:44:55,261 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 18:44:55,261 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:44:55,289 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:44:55,291 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 18:44:55,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:44:55 BoogieIcfgContainer [2024-09-12 18:44:55,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:44:55,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:44:55,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:44:55,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:44:55,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:44:54" (1/3) ... [2024-09-12 18:44:55,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55337912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:44:55, skipping insertion in model container [2024-09-12 18:44:55,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:44:54" (2/3) ... [2024-09-12 18:44:55,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55337912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:44:55, skipping insertion in model container [2024-09-12 18:44:55,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:44:55" (3/3) ... [2024-09-12 18:44:55,302 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound1.i [2024-09-12 18:44:55,324 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:44:55,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 18:44:55,375 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:44:55,382 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;@7d4998fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:44:55,383 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 18:44:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 18:44:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 18:44:55,393 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:44:55,394 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:44:55,394 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:44:55,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1191872707, now seen corresponding path program 1 times [2024-09-12 18:44:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:44:55,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514020074] [2024-09-12 18:44:55,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:44:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:44:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:55,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:44:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:55,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:44:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:44:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:44:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514020074] [2024-09-12 18:44:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514020074] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:44:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:44:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 18:44:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416232575] [2024-09-12 18:44:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:44:55,576 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 18:44:55,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:44:55,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 18:44:55,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 18:44:55,595 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:44:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:44:55,617 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2024-09-12 18:44:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 18:44:55,620 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-12 18:44:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:44:55,627 INFO L225 Difference]: With dead ends: 48 [2024-09-12 18:44:55,627 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 18:44:55,629 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 18:44:55,632 INFO L434 NwaCegarLoop]: 29 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, 29 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 18:44:55,633 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:44:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 18:44:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-12 18:44:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 18:44:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-12 18:44:55,665 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2024-09-12 18:44:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:44:55,666 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-12 18:44:55,666 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:44:55,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-12 18:44:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 18:44:55,668 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:44:55,668 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:44:55,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:44:55,669 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:44:55,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash 419909300, now seen corresponding path program 1 times [2024-09-12 18:44:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:44:55,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659140621] [2024-09-12 18:44:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:44:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:44:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:44:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026361197] [2024-09-12 18:44:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:44:55,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:44:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:44:55,711 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 18:44:55,713 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 18:44:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:55,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 18:44:55,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:44:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:44:55,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:44:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:44:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659140621] [2024-09-12 18:44:55,914 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:44:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026361197] [2024-09-12 18:44:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026361197] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:44:55,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:44:55,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:44:55,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128943579] [2024-09-12 18:44:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:44:55,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:44:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:44:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:44:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:44:55,920 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:44:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:44:55,999 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-12 18:44:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:44:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-12 18:44:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:44:56,003 INFO L225 Difference]: With dead ends: 35 [2024-09-12 18:44:56,003 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 18:44:56,003 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:44:56,004 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:44:56,005 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:44:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 18:44:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 18:44:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 18:44:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-12 18:44:56,022 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2024-09-12 18:44:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:44:56,023 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-12 18:44:56,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 18:44:56,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-12 18:44:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 18:44:56,024 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:44:56,024 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:44:56,044 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 18:44:56,225 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 18:44:56,226 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:44:56,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:56,227 INFO L85 PathProgramCache]: Analyzing trace with hash -53840867, now seen corresponding path program 1 times [2024-09-12 18:44:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:44:56,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218879319] [2024-09-12 18:44:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:44:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:44:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:56,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:44:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:56,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:44:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:56,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-12 18:44:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:44:56,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:44:56,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218879319] [2024-09-12 18:44:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218879319] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:44:56,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:44:56,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:44:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244342510] [2024-09-12 18:44:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:44:56,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 18:44:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:44:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 18:44:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:44:56,633 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:44:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:44:56,657 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-09-12 18:44:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 18:44:56,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-12 18:44:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:44:56,659 INFO L225 Difference]: With dead ends: 56 [2024-09-12 18:44:56,659 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 18:44:56,660 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 18:44:56,661 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:44:56,661 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:44:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 18:44:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-12 18:44:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 18:44:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-12 18:44:56,675 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2024-09-12 18:44:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:44:56,675 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-12 18:44:56,675 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:44:56,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-12 18:44:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 18:44:56,676 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:44:56,676 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:44:56,677 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:44:56,677 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:44:56,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:44:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash -792506632, now seen corresponding path program 1 times [2024-09-12 18:44:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:44:56,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844655827] [2024-09-12 18:44:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:44:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:44:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 18:44:56,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347010805] [2024-09-12 18:44:56,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:44:56,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:44:56,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:44:56,727 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 18:44:56,729 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 18:44:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:44:56,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 18:44:56,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:44:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 18:44:57,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:45:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:45:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844655827] [2024-09-12 18:45:09,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 18:45:09,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347010805] [2024-09-12 18:45:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347010805] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:45:09,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:45:09,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-09-12 18:45:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119467442] [2024-09-12 18:45:09,609 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 18:45:09,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 18:45:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:45:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 18:45:09,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=171, Unknown=3, NotChecked=0, Total=210 [2024-09-12 18:45:09,611 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:45:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:45:09,779 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-09-12 18:45:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:45:09,780 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-09-12 18:45:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:45:09,782 INFO L225 Difference]: With dead ends: 44 [2024-09-12 18:45:09,782 INFO L226 Difference]: Without dead ends: 41 [2024-09-12 18:45:09,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=42, Invalid=195, Unknown=3, NotChecked=0, Total=240 [2024-09-12 18:45:09,784 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:45:09,786 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 104 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:45:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-12 18:45:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-12 18:45:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 18:45:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-12 18:45:09,803 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2024-09-12 18:45:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:45:09,803 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-12 18:45:09,804 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 18:45:09,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:45:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-12 18:45:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 18:45:09,806 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:45:09,806 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:45:09,815 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 18:45:10,010 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-12 18:45:10,012 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 18:45:10,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:45:10,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1699483551, now seen corresponding path program 2 times [2024-09-12 18:45:10,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:45:10,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164076950] [2024-09-12 18:45:10,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:45:10,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:45:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:45:10,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:45:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:45:10,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 18:45:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:45:10,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 18:45:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:45:10,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 18:45:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:45:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:45:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:45:10,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164076950] [2024-09-12 18:45:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164076950] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:45:10,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36361944] [2024-09-12 18:45:10,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:45:10,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:45:10,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:45:10,933 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 18:45:10,935 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 18:45:11,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:45:11,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:45:11,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-12 18:45:11,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:45:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:45:11,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:45:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 18:45:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36361944] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:45:20,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:45:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2024-09-12 18:45:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835802684] [2024-09-12 18:45:20,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:45:20,122 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 18:45:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:45:20,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 18:45:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-09-12 18:45:20,124 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-12 18:45:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:45:20,424 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-09-12 18:45:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:45:20,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) Word has length 36 [2024-09-12 18:45:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:45:20,425 INFO L225 Difference]: With dead ends: 58 [2024-09-12 18:45:20,425 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:45:20,426 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2024-09-12 18:45:20,426 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:45:20,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 171 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:45:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:45:20,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:45:20,428 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 18:45:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:45:20,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-09-12 18:45:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:45:20,428 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:45:20,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 23 states have internal predecessors, (53), 8 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-12 18:45:20,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:45:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:45:20,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:45:20,432 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 18:45:20,441 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 18:45:20,632 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 18:45:20,635 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-09-12 18:45:20,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:45:21,168 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:45:21,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:45:21 BoogieIcfgContainer [2024-09-12 18:45:21,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:45:21,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:45:21,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:45:21,193 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:45:21,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:44:55" (3/4) ... [2024-09-12 18:45:21,195 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:45:21,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:45:21,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-12 18:45:21,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:45:21,198 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 18:45:21,201 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-12 18:45:21,201 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 18:45:21,201 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 18:45:21,202 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 18:45:21,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:45:21,295 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:45:21,295 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:45:21,296 INFO L158 Benchmark]: Toolchain (without parser) took 26632.48ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 51.8MB in the beginning and 44.4MB in the end (delta: 7.4MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-09-12 18:45:21,296 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 52.4MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:45:21,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.15ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 40.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 18:45:21,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.30ms. Allocated memory is still 73.4MB. Free memory was 40.1MB in the beginning and 39.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:45:21,297 INFO L158 Benchmark]: Boogie Preprocessor took 40.43ms. Allocated memory is still 73.4MB. Free memory was 39.0MB in the beginning and 37.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:45:21,297 INFO L158 Benchmark]: RCFGBuilder took 330.04ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 25.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 18:45:21,298 INFO L158 Benchmark]: TraceAbstraction took 25898.04ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 24.4MB in the beginning and 49.5MB in the end (delta: -25.0MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-09-12 18:45:21,298 INFO L158 Benchmark]: Witness Printer took 102.58ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 44.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 18:45:21,299 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.23ms. Allocated memory is still 52.4MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.15ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 40.1MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.30ms. Allocated memory is still 73.4MB. Free memory was 40.1MB in the beginning and 39.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.43ms. Allocated memory is still 73.4MB. Free memory was 39.0MB in the beginning and 37.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.04ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 25.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25898.04ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 24.4MB in the beginning and 49.5MB in the end (delta: -25.0MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 102.58ms. Allocated memory is still 88.1MB. Free memory was 49.5MB in the beginning and 44.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. 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: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 414 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 324 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 101 mSDtfsCounter, 324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=4, InterpolantAutomatonStates: 32, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 23.3s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1384 SizeOfPredicates, 11 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 48/64 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: 34]: Loop Invariant Derived loop invariant: ((((((b == 1) && (A == r)) && ((A % 4294967296) <= 1)) && (q == 0)) && (B == 1)) || (((((((A == r) && ((A % 4294967296) <= 1)) && (b <= 2147483647)) && (1 <= (b / 2))) && (1 <= (r % 4294967296))) && (q == 0)) && (B == 1))) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((b == 1) && (A == r)) && (q == 0)) && (B == 1)) || (((((((A == r) && ((A % 4294967296) <= 1)) && (b <= 2147483647)) && (1 <= (b / 2))) && (1 <= (r % 4294967296))) && (q == 0)) && (B == 1))) || (((((b == 1) && (A == ((long long) r + 1))) && ((A % 4294967296) == 1)) && (B == 1)) && (q == 1))) - 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 18:45:21,329 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE