./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.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 ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:49:16,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:49:17,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:49:17,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:49:17,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:49:17,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:49:17,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:49:17,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:49:17,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:49:17,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:49:17,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:49:17,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:49:17,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:49:17,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:49:17,081 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:49:17,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:49:17,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:49:17,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:49:17,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:49:17,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:49:17,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:49:17,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:49:17,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:49:17,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:49:17,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:49:17,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:49:17,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:49:17,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:49:17,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:49:17,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:49:17,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:49:17,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:49:17,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:49:17,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:49:17,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:49:17,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:49:17,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:49:17,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:49:17,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:49:17,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:49:17,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:49:17,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:49:17,090 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 -> ab65f956ab163b80526b0084797effd91e1aac547effeb9a1fdab821fa279e8e 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:49:17,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:49:17,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:49:17,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:49:17,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:49:17,362 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:49:17,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-09-25 10:49:18,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:49:19,114 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:49:19,115 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i [2024-09-25 10:49:19,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/290fa8e54/b4de16fc332c4e2a803a7912147b481b/FLAG897b3558a [2024-09-25 10:49:19,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/290fa8e54/b4de16fc332c4e2a803a7912147b481b [2024-09-25 10:49:19,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:49:19,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:49:19,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:49:19,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:49:19,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:49:19,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d38011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19, skipping insertion in model container [2024-09-25 10:49:19,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:49:19,335 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2024-09-25 10:49:19,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:49:19,362 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:49:19,371 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound2.i[950,963] [2024-09-25 10:49:19,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:49:19,390 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:49:19,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19 WrapperNode [2024-09-25 10:49:19,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:49:19,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:49:19,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:49:19,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:49:19,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,404 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:49:19,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:49:19,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:49:19,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:49:19,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:49:19,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,427 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:49:19,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:49:19,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:49:19,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:49:19,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:49:19,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (1/1) ... [2024-09-25 10:49:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:49:19,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:19,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:49:19,472 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:49:19,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:49:19,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:49:19,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:49:19,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:49:19,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:49:19,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:49:19,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:49:19,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:49:19,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:49:19,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:49:19,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:49:19,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:49:19,547 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:49:19,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:49:19,644 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:49:19,645 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:49:19,657 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:49:19,657 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:49:19,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:19 BoogieIcfgContainer [2024-09-25 10:49:19,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:49:19,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:49:19,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:49:19,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:49:19,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:49:19" (1/3) ... [2024-09-25 10:49:19,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec6b631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:49:19, skipping insertion in model container [2024-09-25 10:49:19,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:49:19" (2/3) ... [2024-09-25 10:49:19,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ec6b631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:49:19, skipping insertion in model container [2024-09-25 10:49:19,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:19" (3/3) ... [2024-09-25 10:49:19,669 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2024-09-25 10:49:19,680 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:49:19,681 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:49:19,730 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:49:19,736 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;@1f9feefd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:49:19,736 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:49:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:49:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:49:19,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:19,748 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:19,749 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:19,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1602480078, now seen corresponding path program 1 times [2024-09-25 10:49:19,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:19,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176066013] [2024-09-25 10:49:19,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:19,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:19,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:19,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:19,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176066013] [2024-09-25 10:49:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176066013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:49:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488995132] [2024-09-25 10:49:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:19,935 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:49:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:19,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:49:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:49:19,952 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:20,030 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2024-09-25 10:49:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:49:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 10:49:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:20,038 INFO L225 Difference]: With dead ends: 57 [2024-09-25 10:49:20,038 INFO L226 Difference]: Without dead ends: 28 [2024-09-25 10:49:20,040 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:49:20,045 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:20,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-25 10:49:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-25 10:49:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:49:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-25 10:49:20,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-09-25 10:49:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:20,080 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-25 10:49:20,081 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-25 10:49:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:49:20,084 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,084 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] [2024-09-25 10:49:20,085 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:49:20,085 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:20,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash 610811680, now seen corresponding path program 1 times [2024-09-25 10:49:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:20,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880203743] [2024-09-25 10:49:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:20,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880203743] [2024-09-25 10:49:20,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880203743] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:20,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:20,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:49:20,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034963164] [2024-09-25 10:49:20,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:20,302 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:49:20,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:49:20,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:49:20,305 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:20,392 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-09-25 10:49:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:49:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-25 10:49:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:20,394 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:49:20,394 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 10:49:20,395 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-25 10:49:20,396 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:20,397 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 10:49:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 10:49:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:49:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-25 10:49:20,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 24 [2024-09-25 10:49:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:20,407 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-25 10:49:20,407 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-25 10:49:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:49:20,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,409 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] [2024-09-25 10:49:20,409 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:49:20,410 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:20,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1424295131, now seen corresponding path program 1 times [2024-09-25 10:49:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158310262] [2024-09-25 10:49:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:20,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:20,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158310262] [2024-09-25 10:49:20,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158310262] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 10:49:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657111715] [2024-09-25 10:49:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:20,577 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:49:20,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:20,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:49:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:49:20,578 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:20,663 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-25 10:49:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:49:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-09-25 10:49:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:20,664 INFO L225 Difference]: With dead ends: 40 [2024-09-25 10:49:20,664 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:49:20,665 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:49:20,666 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:20,666 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:49:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-09-25 10:49:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:49:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-25 10:49:20,675 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2024-09-25 10:49:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:20,676 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-25 10:49:20,676 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 10:49:20,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-25 10:49:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:49:20,677 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,677 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] [2024-09-25 10:49:20,677 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:49:20,678 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:20,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1426082591, now seen corresponding path program 1 times [2024-09-25 10:49:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282077185] [2024-09-25 10:49:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 10:49:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755294774] [2024-09-25 10:49:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:20,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:20,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:20,700 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:49:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:20,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:49:20,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:20,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:49:20,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:20,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282077185] [2024-09-25 10:49:20,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 10:49:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755294774] [2024-09-25 10:49:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755294774] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:49:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732407277] [2024-09-25 10:49:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:20,801 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:49:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:20,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:49:20,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:49:20,802 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 10:49:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:20,840 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2024-09-25 10:49:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:49:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-25 10:49:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:20,841 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:49:20,842 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 10:49:20,842 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-25 10:49:20,843 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 90 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.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:20,843 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 90 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 10:49:20,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-09-25 10:49:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:49:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-09-25 10:49:20,849 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 25 [2024-09-25 10:49:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:20,850 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-09-25 10:49:20,850 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 10:49:20,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-09-25 10:49:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:49:20,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:20,851 INFO L216 NwaCegarLoop]: trace histogram [2, 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-25 10:49:20,867 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:49:21,055 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:21,057 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:21,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1945714758, now seen corresponding path program 1 times [2024-09-25 10:49:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:21,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978044534] [2024-09-25 10:49:21,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 10:49:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:21,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:21,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978044534] [2024-09-25 10:49:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978044534] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:21,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:49:21,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:49:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214211807] [2024-09-25 10:49:21,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:21,293 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:49:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:49:21,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:49:21,293 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:49:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:21,349 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-09-25 10:49:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:49:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-09-25 10:49:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:21,350 INFO L225 Difference]: With dead ends: 64 [2024-09-25 10:49:21,351 INFO L226 Difference]: Without dead ends: 39 [2024-09-25 10:49:21,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:49:21,354 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:21,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-25 10:49:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-25 10:49:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:49:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-09-25 10:49:21,365 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 34 [2024-09-25 10:49:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:21,365 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-09-25 10:49:21,365 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:49:21,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-09-25 10:49:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:49:21,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:21,366 INFO L216 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2024-09-25 10:49:21,366 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:49:21,366 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:21,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1465893311, now seen corresponding path program 1 times [2024-09-25 10:49:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725662158] [2024-09-25 10:49:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 10:49:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:49:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:21,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725662158] [2024-09-25 10:49:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725662158] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499574778] [2024-09-25 10:49:21,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:21,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:21,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:21,478 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:49:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:21,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:49:21,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 10:49:21,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:49:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:49:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499574778] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:49:21,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:49:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2024-09-25 10:49:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552358599] [2024-09-25 10:49:21,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:49:21,616 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:49:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:49:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:49:21,617 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-25 10:49:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:21,698 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-09-25 10:49:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:49:21,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 36 [2024-09-25 10:49:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:21,699 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:49:21,699 INFO L226 Difference]: Without dead ends: 41 [2024-09-25 10:49:21,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:49:21,700 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:21,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:49:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-25 10:49:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-25 10:49:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:49:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-09-25 10:49:21,708 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2024-09-25 10:49:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:21,708 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-09-25 10:49:21,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-25 10:49:21,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-09-25 10:49:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 10:49:21,710 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:49:21,710 INFO L216 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2024-09-25 10:49:21,728 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:49:21,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:49:21,914 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:49:21,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:21,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1514871206, now seen corresponding path program 1 times [2024-09-25 10:49:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:49:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704072070] [2024-09-25 10:49:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:21,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:49:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:49:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:49:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 10:49:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 10:49:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:49:22,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:49:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704072070] [2024-09-25 10:49:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704072070] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:49:22,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213197776] [2024-09-25 10:49:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:49:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:49:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:49:22,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:49:22,035 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:49:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:49:22,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:49:22,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:49:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:49:22,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:49:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213197776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:49:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:49:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2024-09-25 10:49:22,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860603563] [2024-09-25 10:49:22,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:49:22,143 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:49:22,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:49:22,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:49:22,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:49:22,143 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:49:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:49:22,170 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-09-25 10:49:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:49:22,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-09-25 10:49:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:49:22,172 INFO L225 Difference]: With dead ends: 43 [2024-09-25 10:49:22,172 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:49:22,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:49:22,175 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:49:22,175 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:49:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:49:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:49:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 10:49:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:49:22,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-09-25 10:49:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:49:22,176 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:49:22,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 10:49:22,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:49:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:49:22,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:49:22,179 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:49:22,209 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:49:22,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:49:22,383 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:49:22,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:49:22,757 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:49:22,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:49:22,777 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:49:22,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:49:22,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:49:22,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:49:22,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:49:22,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:49:22,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:49:22,779 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (and (= ~counter~0 0) (= |old(~counter~0)| 0)) Eliminated clause: (= ~counter~0 0) [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:49:22,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:49:22,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:49:22,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:49:22 BoogieIcfgContainer [2024-09-25 10:49:22,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:49:22,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:49:22,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:49:22,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:49:22,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:49:19" (3/4) ... [2024-09-25 10:49:22,784 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:49:22,821 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:49:22,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:49:22,822 INFO L158 Benchmark]: Toolchain (without parser) took 3666.03ms. Allocated memory was 75.5MB in the beginning and 142.6MB in the end (delta: 67.1MB). Free memory was 36.5MB in the beginning and 89.8MB in the end (delta: -53.2MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-09-25 10:49:22,822 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:49:22,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.34ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 45.9MB in the end (delta: -9.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-09-25 10:49:22,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 13.17ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 44.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:49:22,822 INFO L158 Benchmark]: Boogie Preprocessor took 33.11ms. Allocated memory is still 75.5MB. Free memory was 44.9MB in the beginning and 43.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:49:22,823 INFO L158 Benchmark]: RCFGBuilder took 225.09ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 43.1MB in the beginning and 95.7MB in the end (delta: -52.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 10:49:22,823 INFO L158 Benchmark]: TraceAbstraction took 3116.88ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 95.2MB in the beginning and 91.9MB in the end (delta: 3.3MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2024-09-25 10:49:22,823 INFO L158 Benchmark]: Witness Printer took 39.25ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:49:22,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.34ms. Allocated memory is still 75.5MB. Free memory was 36.4MB in the beginning and 45.9MB in the end (delta: -9.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 13.17ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 44.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.11ms. Allocated memory is still 75.5MB. Free memory was 44.9MB in the beginning and 43.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 225.09ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 43.1MB in the beginning and 95.7MB in the end (delta: -52.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3116.88ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 95.2MB in the beginning and 91.9MB in the end (delta: 3.3MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. * Witness Printer took 39.25ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 143 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 600 SizeOfPredicates, 6 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 68/76 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: 36]: Loop Invariant Derived loop invariant: ((\old(counter) == 0) && (((((2 <= counter) && (A == r)) && (q == 0)) || ((((A == r) && (counter == 0)) && (B == b)) && (q == 0))) || (((A == r) && (q == 0)) && (counter == 1)))) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((2 <= counter) && (A == r)) && (q == 0)) || (((A == r) && (B == b)) && (q == 0))) && (\old(counter) == 0)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (counter == 0) Ensures: ((counter == \old(counter)) && (counter == 0)) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: ((counter == \old(counter)) && (1 <= cond)) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:49:22,845 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