./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c 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/loop-lit/bh2017-ex1-poly.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 d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:18:01,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:18:01,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:18:01,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:18:01,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:18:01,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:18:01,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:18:01,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:18:01,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:18:01,982 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:18:01,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:18:01,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:18:01,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:18:01,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:18:01,985 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:18:01,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:18:01,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:18:01,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:18:01,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:18:01,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:18:01,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:18:01,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:18:01,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:18:01,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:18:01,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:18:01,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:18:01,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:18:01,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:18:01,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:18:01,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:18:01,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:18:01,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:18:01,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:18:01,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:18:01,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:18:01,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:18:01,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:18:01,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:18:01,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:18:01,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:18:01,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:18:01,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:18:01,994 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 -> d6dbcbf51695ea037a123bcc006ce5f6db095b874a22b169ec869d834ce41de6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:18:02,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:18:02,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:18:02,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:18:02,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:18:02,256 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:18:02,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-10-15 14:18:03,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:18:03,833 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:18:03,834 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/bh2017-ex1-poly.i [2024-10-15 14:18:03,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/eda6e2e49/7b75067a624b4c72b94b0a8c4f0d4067/FLAGb60c3f59f [2024-10-15 14:18:03,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/eda6e2e49/7b75067a624b4c72b94b0a8c4f0d4067 [2024-10-15 14:18:03,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:18:03,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:18:03,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:18:03,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:18:03,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:18:03,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:18:03" (1/1) ... [2024-10-15 14:18:03,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61523b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:03, skipping insertion in model container [2024-10-15 14:18:03,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:18:03" (1/1) ... [2024-10-15 14:18:03,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:18:04,043 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/loop-lit/bh2017-ex1-poly.i[804,817] [2024-10-15 14:18:04,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:18:04,065 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:18:04,076 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/loop-lit/bh2017-ex1-poly.i[804,817] [2024-10-15 14:18:04,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:18:04,095 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:18:04,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04 WrapperNode [2024-10-15 14:18:04,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:18:04,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:18:04,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:18:04,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:18:04,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,128 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:18:04,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:18:04,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:18:04,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:18:04,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:18:04,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,151 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-10-15 14:18:04,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:18:04,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:18:04,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:18:04,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:18:04,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (1/1) ... [2024-10-15 14:18:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:18:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:18:04,204 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-10-15 14:18:04,207 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-10-15 14:18:04,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:18:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:18:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:18:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:18:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:18:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:18:04,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:18:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:18:04,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:18:04,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:18:04,300 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:18:04,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:18:04,418 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 14:18:04,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:18:04,447 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:18:04,447 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:18:04,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:18:04 BoogieIcfgContainer [2024-10-15 14:18:04,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:18:04,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:18:04,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:18:04,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:18:04,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:18:03" (1/3) ... [2024-10-15 14:18:04,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e075bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:18:04, skipping insertion in model container [2024-10-15 14:18:04,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:18:04" (2/3) ... [2024-10-15 14:18:04,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e075bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:18:04, skipping insertion in model container [2024-10-15 14:18:04,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:18:04" (3/3) ... [2024-10-15 14:18:04,457 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex1-poly.i [2024-10-15 14:18:04,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:18:04,473 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:18:04,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:18:04,521 INFO L333 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;@701a03d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:18:04,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:18:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-15 14:18:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:18:04,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:04,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:04,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1205805759, now seen corresponding path program 1 times [2024-10-15 14:18:04,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220108421] [2024-10-15 14:18:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:04,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220108421] [2024-10-15 14:18:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220108421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:18:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035075106] [2024-10-15 14:18:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:18:04,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:04,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:18:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:18:04,775 INFO L87 Difference]: Start difference. First operand has 26 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:04,819 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2024-10-15 14:18:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:18:04,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-15 14:18:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:04,829 INFO L225 Difference]: With dead ends: 48 [2024-10-15 14:18:04,829 INFO L226 Difference]: Without dead ends: 23 [2024-10-15 14:18:04,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-15 14:18:04,837 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:04,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:18:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-15 14:18:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-15 14:18:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 14:18:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-15 14:18:04,873 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-10-15 14:18:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-15 14:18:04,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:04,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-15 14:18:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:18:04,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:04,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:04,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:18:04,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:04,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1204197045, now seen corresponding path program 1 times [2024-10-15 14:18:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:04,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569361939] [2024-10-15 14:18:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:05,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569361939] [2024-10-15 14:18:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569361939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:05,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:05,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:18:05,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770382124] [2024-10-15 14:18:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:18:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:05,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:18:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:18:05,075 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:05,182 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-15 14:18:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:18:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-15 14:18:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:05,184 INFO L225 Difference]: With dead ends: 29 [2024-10-15 14:18:05,184 INFO L226 Difference]: Without dead ends: 27 [2024-10-15 14:18:05,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:18:05,186 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:05,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:18:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-15 14:18:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-15 14:18:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-15 14:18:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-15 14:18:05,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-10-15 14:18:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-15 14:18:05,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:18:05,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-15 14:18:05,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:18:05,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:05,205 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:05,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:18:05,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:05,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1149323679, now seen corresponding path program 1 times [2024-10-15 14:18:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:05,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089207261] [2024-10-15 14:18:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 14:18:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:18:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089207261] [2024-10-15 14:18:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089207261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:05,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:05,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:18:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593172467] [2024-10-15 14:18:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:05,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:18:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:18:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:18:05,401 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:18:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:05,519 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2024-10-15 14:18:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:18:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-15 14:18:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:05,521 INFO L225 Difference]: With dead ends: 45 [2024-10-15 14:18:05,521 INFO L226 Difference]: Without dead ends: 43 [2024-10-15 14:18:05,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:18:05,522 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:05,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:18:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-15 14:18:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-10-15 14:18:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-15 14:18:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-10-15 14:18:05,540 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 16 [2024-10-15 14:18:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:05,541 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-10-15 14:18:05,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:18:05,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-10-15 14:18:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-15 14:18:05,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:05,542 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:05,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:18:05,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash 429495691, now seen corresponding path program 1 times [2024-10-15 14:18:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661405590] [2024-10-15 14:18:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 14:18:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:18:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:18:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661405590] [2024-10-15 14:18:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661405590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:18:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517557967] [2024-10-15 14:18:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:18:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:18:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:18:05,719 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:18:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:05,831 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-10-15 14:18:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:18:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-10-15 14:18:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:05,834 INFO L225 Difference]: With dead ends: 49 [2024-10-15 14:18:05,834 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 14:18:05,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:18:05,837 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:05,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:18:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 14:18:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-15 14:18:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-15 14:18:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-10-15 14:18:05,850 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2024-10-15 14:18:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-10-15 14:18:05,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:18:05,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-10-15 14:18:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:18:05,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:05,853 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:05,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:18:05,853 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:05,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1103951071, now seen corresponding path program 1 times [2024-10-15 14:18:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2797687] [2024-10-15 14:18:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 14:18:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:18:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:18:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 14:18:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2797687] [2024-10-15 14:18:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2797687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:05,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:05,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:18:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44773979] [2024-10-15 14:18:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:05,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:18:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:05,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:18:05,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:18:05,967 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:18:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:06,033 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2024-10-15 14:18:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:18:06,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 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 26 [2024-10-15 14:18:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:06,040 INFO L225 Difference]: With dead ends: 92 [2024-10-15 14:18:06,041 INFO L226 Difference]: Without dead ends: 59 [2024-10-15 14:18:06,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:18:06,043 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:06,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:18:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-15 14:18:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-15 14:18:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 14:18:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-10-15 14:18:06,070 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 26 [2024-10-15 14:18:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:06,070 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-10-15 14:18:06,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-15 14:18:06,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-10-15 14:18:06,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-15 14:18:06,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:06,072 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:06,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:18:06,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1044941344, now seen corresponding path program 1 times [2024-10-15 14:18:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403075837] [2024-10-15 14:18:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 14:18:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:18:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:18:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:18:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:18:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:18:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 14:18:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-15 14:18:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:06,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403075837] [2024-10-15 14:18:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403075837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:18:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444741698] [2024-10-15 14:18:06,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:06,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:18:06,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:18:06,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:18:06,210 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:18:06,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:06,267 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-10-15 14:18:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:18:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-10-15 14:18:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:06,270 INFO L225 Difference]: With dead ends: 65 [2024-10-15 14:18:06,271 INFO L226 Difference]: Without dead ends: 63 [2024-10-15 14:18:06,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-10-15 14:18:06,272 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:06,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 80 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:18:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-15 14:18:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-15 14:18:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 14:18:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-10-15 14:18:06,298 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 47 [2024-10-15 14:18:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:06,298 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-10-15 14:18:06,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-15 14:18:06,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-10-15 14:18:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-15 14:18:06,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:06,303 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:06,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:18:06,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:06,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash 733242377, now seen corresponding path program 1 times [2024-10-15 14:18:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:06,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946712265] [2024-10-15 14:18:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:06,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 14:18:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:18:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:18:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:18:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:18:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:18:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 14:18:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:18:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-15 14:18:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-15 14:18:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:18:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:18:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-15 14:18:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 30 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:18:06,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946712265] [2024-10-15 14:18:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946712265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:18:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549102195] [2024-10-15 14:18:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:06,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:18:06,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:18:06,682 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-10-15 14:18:06,687 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:18:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:06,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 14:18:06,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:18:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:18:07,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:18:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-15 14:18:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549102195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:18:07,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:18:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 24 [2024-10-15 14:18:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818043608] [2024-10-15 14:18:07,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:18:07,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 14:18:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:07,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 14:18:07,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-15 14:18:07,525 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 12 states have call successors, (43), 3 states have call predecessors, (43), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-10-15 14:18:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:07,861 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-10-15 14:18:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 14:18:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 12 states have call successors, (43), 3 states have call predecessors, (43), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) Word has length 81 [2024-10-15 14:18:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:07,864 INFO L225 Difference]: With dead ends: 83 [2024-10-15 14:18:07,864 INFO L226 Difference]: Without dead ends: 81 [2024-10-15 14:18:07,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2024-10-15 14:18:07,865 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:07,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 484 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-15 14:18:07,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-15 14:18:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2024-10-15 14:18:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-15 14:18:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2024-10-15 14:18:07,884 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 81 [2024-10-15 14:18:07,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:07,885 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2024-10-15 14:18:07,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 12 states have call successors, (43), 3 states have call predecessors, (43), 1 states have return successors, (39), 12 states have call predecessors, (39), 12 states have call successors, (39) [2024-10-15 14:18:07,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2024-10-15 14:18:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-15 14:18:07,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:18:07,889 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:07,907 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:18:08,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:18:08,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:18:08,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:08,091 INFO L85 PathProgramCache]: Analyzing trace with hash -852988575, now seen corresponding path program 2 times [2024-10-15 14:18:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:18:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131003187] [2024-10-15 14:18:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:18:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:18:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:18:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-15 14:18:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-15 14:18:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 14:18:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 14:18:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:18:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:18:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 14:18:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:18:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-15 14:18:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-15 14:18:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-15 14:18:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-15 14:18:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-15 14:18:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-15 14:18:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:18:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-10-15 14:18:08,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:18:08,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131003187] [2024-10-15 14:18:08,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131003187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:18:08,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:18:08,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:18:08,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006263392] [2024-10-15 14:18:08,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:18:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:18:08,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:18:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:18:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:18:08,240 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-15 14:18:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:18:08,300 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-10-15 14:18:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:18:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 86 [2024-10-15 14:18:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:18:08,302 INFO L225 Difference]: With dead ends: 71 [2024-10-15 14:18:08,302 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:18:08,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:18:08,303 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:18:08,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 72 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:18:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:18:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:18:08,308 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-10-15 14:18:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:18:08,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2024-10-15 14:18:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:18:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:18:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-15 14:18:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:18:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:18:08,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:18:08,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:18:08,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-15 14:18:08,315 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-15 14:18:08,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:18:08,830 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:18:08,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:18:08 BoogieIcfgContainer [2024-10-15 14:18:08,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:18:08,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:18:08,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:18:08,856 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:18:08,856 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:18:04" (3/4) ... [2024-10-15 14:18:08,858 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:18:08,909 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:18:08,909 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:18:08,909 INFO L158 Benchmark]: Toolchain (without parser) took 5053.28ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 75.7MB in the beginning and 181.1MB in the end (delta: -105.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:18:08,909 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:18:08,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.73ms. Allocated memory is still 146.8MB. Free memory was 75.6MB in the beginning and 63.3MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-15 14:18:08,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 146.8MB. Free memory was 63.3MB in the beginning and 117.0MB in the end (delta: -53.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-15 14:18:08,910 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 117.0MB in the beginning and 167.6MB in the end (delta: -50.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:18:08,911 INFO L158 Benchmark]: RCFGBuilder took 276.39ms. Allocated memory is still 195.0MB. Free memory was 167.6MB in the beginning and 155.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:18:08,911 INFO L158 Benchmark]: TraceAbstraction took 4405.37ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 154.0MB in the beginning and 183.2MB in the end (delta: -29.2MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2024-10-15 14:18:08,911 INFO L158 Benchmark]: Witness Printer took 53.23ms. Allocated memory is still 234.9MB. Free memory was 183.2MB in the beginning and 181.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:18:08,913 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.19ms. Allocated memory is still 146.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.73ms. Allocated memory is still 146.8MB. Free memory was 75.6MB in the beginning and 63.3MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 146.8MB. Free memory was 63.3MB in the beginning and 117.0MB in the end (delta: -53.8MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.82ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 117.0MB in the beginning and 167.6MB in the end (delta: -50.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 276.39ms. Allocated memory is still 195.0MB. Free memory was 167.6MB in the beginning and 155.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4405.37ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 154.0MB in the beginning and 183.2MB in the end (delta: -29.2MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 53.23ms. Allocated memory is still 234.9MB. Free memory was 183.2MB in the beginning and 181.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 1082 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 664 IncrementalHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 221 mSDtfsCounter, 664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 256 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 54, 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, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 451 ConstructedInterpolants, 0 QuantifiedInterpolants, 1067 SizeOfPredicates, 1 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 1573/1599 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: 18]: Loop Invariant Derived loop invariant: ((((((j <= 4) && (2 <= j)) && (j == ((long long) i * 2))) || ((((((long long) i * 2) <= ((long long) j + 6)) && (j <= 4)) && (2 <= j)) && (((long long) j + 2) <= ((long long) i * 2)))) || (((j == 0) && (1 <= i)) && (i <= 3))) || ((j == 0) && (i == 0))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((0 < i) || (i == 0)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:18:08,945 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