./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/nla-digbench-scaling/dijkstra-u_valuebound10.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74bed2c5921e53f16e234cbc0a2deaaf4b0b51c6cc3f20bfab2fd33a0fce7ecf --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:38:11,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:38:11,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:38:11,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:38:11,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:38:11,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:38:11,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:38:11,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:38:11,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:38:11,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:38:11,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:38:11,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:38:11,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:38:11,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:38:11,954 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:38:11,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:38:11,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:38:11,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:38:11,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:38:11,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:38:11,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:38:11,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:38:11,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:38:11,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:38:11,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:38:11,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:38:11,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:38:11,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:38:11,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:38:11,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:38:11,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:38:11,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:38:11,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:38:11,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:38:11,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:38:11,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:38:11,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:38:11,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:38:11,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:38:11,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:38:11,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:38:11,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:38:11,962 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 -> 74bed2c5921e53f16e234cbc0a2deaaf4b0b51c6cc3f20bfab2fd33a0fce7ecf 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:38:12,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:38:12,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:38:12,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:38:12,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:38:12,253 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:38:12,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c [2024-10-15 14:38:13,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:38:13,817 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:38:13,818 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c [2024-10-15 14:38:13,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0d20cf8c8/acb948e207ca4ebc964913ffe2011954/FLAG30cc3c02a [2024-10-15 14:38:13,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0d20cf8c8/acb948e207ca4ebc964913ffe2011954 [2024-10-15 14:38:13,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:38:13,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:38:13,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:38:13,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:38:13,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:38:13,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:38:13" (1/1) ... [2024-10-15 14:38:13,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5f13c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:13, skipping insertion in model container [2024-10-15 14:38:13,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:38:13" (1/1) ... [2024-10-15 14:38:13,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:38:14,042 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2024-10-15 14:38:14,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:38:14,079 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:38:14,088 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2024-10-15 14:38:14,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:38:14,114 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:38:14,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14 WrapperNode [2024-10-15 14:38:14,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:38:14,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:38:14,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:38:14,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:38:14,124 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:38:14" (1/1) ... [2024-10-15 14:38:14,129 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:38:14" (1/1) ... [2024-10-15 14:38:14,136 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:38:14,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:38:14,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:38:14,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:38:14,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:38:14,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,164 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:38:14,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:38:14,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:38:14,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:38:14,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:38:14,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (1/1) ... [2024-10-15 14:38:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:38:14,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:14,216 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:38:14,219 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:38:14,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:38:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:38:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:38:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:38:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:38:14,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:38:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:38:14,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:38:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:38:14,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:38:14,326 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:38:14,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:38:14,627 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:38:14,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:38:14,642 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:38:14,643 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:38:14,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:38:14 BoogieIcfgContainer [2024-10-15 14:38:14,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:38:14,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:38:14,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:38:14,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:38:14,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:38:13" (1/3) ... [2024-10-15 14:38:14,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c65042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:38:14, skipping insertion in model container [2024-10-15 14:38:14,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:14" (2/3) ... [2024-10-15 14:38:14,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c65042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:38:14, skipping insertion in model container [2024-10-15 14:38:14,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:38:14" (3/3) ... [2024-10-15 14:38:14,654 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound10.c [2024-10-15 14:38:14,669 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:38:14,669 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:38:14,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:38:14,718 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;@121935f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:38:14,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:38:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 14:38:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:38:14,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:14,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:14,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:14,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-10-15 14:38:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:14,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512349480] [2024-10-15 14:38:14,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:38:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:38:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:14,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:38:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512349480] [2024-10-15 14:38:14,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512349480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:38:14,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:38:14,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:38:14,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887665616] [2024-10-15 14:38:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:38:14,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:38:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:38:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:38:14,953 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:38:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:14,988 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-10-15 14:38:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:38:14,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-10-15 14:38:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:14,999 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:38:14,999 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 14:38:15,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:38:15,008 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:15,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:38:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 14:38:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 14:38:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-15 14:38:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-10-15 14:38:15,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-10-15 14:38:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-10-15 14:38:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:38:15,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-10-15 14:38:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-15 14:38:15,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:15,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:15,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:38:15,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:15,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:15,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-10-15 14:38:15,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319599018] [2024-10-15 14:38:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:15,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:38:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:38:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:38:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:15,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:15,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319599018] [2024-10-15 14:38:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319599018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:38:15,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:38:15,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:38:15,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686013586] [2024-10-15 14:38:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:38:15,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:38:15,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:15,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:38:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:38:15,587 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:15,878 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-10-15 14:38:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:38:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-15 14:38:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:15,881 INFO L225 Difference]: With dead ends: 64 [2024-10-15 14:38:15,881 INFO L226 Difference]: Without dead ends: 46 [2024-10-15 14:38:15,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:38:15,883 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:15,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:38:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-15 14:38:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-15 14:38:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-15 14:38:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-10-15 14:38:15,911 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-10-15 14:38:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:15,911 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-10-15 14:38:15,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-10-15 14:38:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-15 14:38:15,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:15,916 INFO L215 NwaCegarLoop]: trace histogram [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:38:15,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:38:15,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:15,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-10-15 14:38:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716889147] [2024-10-15 14:38:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:38:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:16,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:38:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:16,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:38:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716889147] [2024-10-15 14:38:16,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716889147] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:38:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487239204] [2024-10-15 14:38:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:16,366 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:38:16,368 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:38:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:16,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 14:38:16,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:38:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:16,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:38:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487239204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:38:16,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:38:16,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-15 14:38:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838747284] [2024-10-15 14:38:16,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:38:16,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:38:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:38:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:38:16,763 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:18,722 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-10-15 14:38:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:38:18,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-15 14:38:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:18,725 INFO L225 Difference]: With dead ends: 115 [2024-10-15 14:38:18,725 INFO L226 Difference]: Without dead ends: 97 [2024-10-15 14:38:18,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:38:18,727 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:18,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-15 14:38:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-15 14:38:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-10-15 14:38:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-15 14:38:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-10-15 14:38:18,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-10-15 14:38:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:18,758 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-10-15 14:38:18,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-10-15 14:38:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:38:18,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:18,761 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:18,778 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:38:18,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:18,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:18,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:18,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-10-15 14:38:18,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:18,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341173742] [2024-10-15 14:38:18,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:18,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:38:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049346203] [2024-10-15 14:38:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:18,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:18,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:38:19,001 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:38:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:19,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:38:19,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:38:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 14:38:19,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:38:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341173742] [2024-10-15 14:38:19,095 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:38:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049346203] [2024-10-15 14:38:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049346203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:38:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:38:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:38:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390548637] [2024-10-15 14:38:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:38:19,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:38:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:38:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:38:19,097 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:38:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:19,276 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-10-15 14:38:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:38:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-15 14:38:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:19,278 INFO L225 Difference]: With dead ends: 90 [2024-10-15 14:38:19,278 INFO L226 Difference]: Without dead ends: 87 [2024-10-15 14:38:19,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:38:19,280 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:19,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:38:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-15 14:38:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-15 14:38:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:38:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-15 14:38:19,299 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-10-15 14:38:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:19,299 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-15 14:38:19,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:38:19,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-15 14:38:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:38:19,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:19,301 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:19,318 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:38:19,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:19,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:19,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-10-15 14:38:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507690570] [2024-10-15 14:38:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:38:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912959181] [2024-10-15 14:38:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:19,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:19,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:38:19,528 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:38:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:19,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 14:38:19,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:38:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:19,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:38:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507690570] [2024-10-15 14:38:23,160 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:38:23,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912959181] [2024-10-15 14:38:23,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912959181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:38:23,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:38:23,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-15 14:38:23,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132788408] [2024-10-15 14:38:23,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:38:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:38:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:38:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:38:23,162 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 14:38:36,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:37,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:38:40,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:44,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:45,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:49,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:53,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:58,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:02,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:06,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:10,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:15,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:19,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:23,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:39:25,288 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-10-15 14:39:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:39:25,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-10-15 14:39:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:39:25,290 INFO L225 Difference]: With dead ends: 156 [2024-10-15 14:39:25,290 INFO L226 Difference]: Without dead ends: 132 [2024-10-15 14:39:25,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:39:25,292 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 55 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:39:25,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 52.9s Time] [2024-10-15 14:39:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-15 14:39:25,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-10-15 14:39:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-15 14:39:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-10-15 14:39:25,348 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-10-15 14:39:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:39:25,348 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-10-15 14:39:25,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 14:39:25,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-10-15 14:39:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:39:25,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:39:25,351 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:39:25,358 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:39:25,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:25,552 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:39:25,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:25,553 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-10-15 14:39:25,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:39:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220258970] [2024-10-15 14:39:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:25,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:39:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:39:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:39:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:39:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-15 14:39:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-15 14:39:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-15 14:39:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-15 14:39:25,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:39:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220258970] [2024-10-15 14:39:25,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220258970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:39:25,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77804466] [2024-10-15 14:39:25,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:25,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:25,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:39:25,763 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:39:25,765 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:39:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:25,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 14:39:25,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:39:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-15 14:39:25,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:39:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-15 14:39:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77804466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:39:26,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:39:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-15 14:39:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514184603] [2024-10-15 14:39:26,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:39:26,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:39:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:39:26,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:39:26,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:39:26,156 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-15 14:39:30,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:39:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:39:31,200 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2024-10-15 14:39:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:39:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 44 [2024-10-15 14:39:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:39:31,202 INFO L225 Difference]: With dead ends: 177 [2024-10-15 14:39:31,202 INFO L226 Difference]: Without dead ends: 135 [2024-10-15 14:39:31,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-10-15 14:39:31,204 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 84 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 180 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:39:31,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 245 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 167 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-10-15 14:39:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-15 14:39:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2024-10-15 14:39:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-15 14:39:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2024-10-15 14:39:31,229 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 44 [2024-10-15 14:39:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:39:31,230 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2024-10-15 14:39:31,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-15 14:39:31,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2024-10-15 14:39:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-15 14:39:31,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:39:31,233 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:39:31,250 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:39:31,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:31,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:39:31,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-10-15 14:39:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:39:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928124725] [2024-10-15 14:39:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:39:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:39:31,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686613055] [2024-10-15 14:39:31,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:31,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:31,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:39:31,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:39:31,512 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:39:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:31,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 14:39:31,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:39:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-15 14:39:31,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:39:36,074 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-10-15 14:39:36,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:39:36,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928124725] [2024-10-15 14:39:36,082 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:39:36,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686613055] [2024-10-15 14:39:36,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686613055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:39:36,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:39:36,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-15 14:39:36,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447665670] [2024-10-15 14:39:36,082 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-15 14:39:36,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:39:36,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:39:36,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:39:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-10-15 14:39:36,084 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-15 14:39:38,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:39:42,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:39:42,514 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2024-10-15 14:39:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:39:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-10-15 14:39:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:39:42,516 INFO L225 Difference]: With dead ends: 133 [2024-10-15 14:39:42,517 INFO L226 Difference]: Without dead ends: 111 [2024-10-15 14:39:42,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-10-15 14:39:42,518 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:39:42,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-10-15 14:39:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-15 14:39:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-15 14:39:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-15 14:39:42,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2024-10-15 14:39:42,541 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 59 [2024-10-15 14:39:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:39:42,541 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2024-10-15 14:39:42,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-15 14:39:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2024-10-15 14:39:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-15 14:39:42,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:39:42,543 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:39:42,560 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:39:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:39:42,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:39:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-10-15 14:39:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:39:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374178399] [2024-10-15 14:39:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:39:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:39:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:39:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:39:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:39:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-15 14:39:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-15 14:39:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 14:39:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:39:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:39:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-15 14:39:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:39:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374178399] [2024-10-15 14:39:43,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374178399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:39:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755420689] [2024-10-15 14:39:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:43,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:39:43,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:39:43,586 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:39:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:43,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-15 14:39:43,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:39:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 14:39:44,242 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:40:05,777 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:40:33,890 WARN L286 SmtUtils]: Spent 24.09s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:41:02,765 WARN L286 SmtUtils]: Spent 16.23s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:41:19,381 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:41:39,503 WARN L286 SmtUtils]: Spent 20.11s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:42:12,109 WARN L286 SmtUtils]: Spent 16.16s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:42:16,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (div (mod c_main_~q~0 4294967296) 4))) (let ((.cse2 (mod (+ (* 2 c_main_~p~0) c_main_~q~0) 4294967296)) (.cse9 (mod (+ (* 4294967295 .cse4) (* 4294967295 c_main_~p~0)) 4294967296)) (.cse1 (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse4) c_main_~p~0) 4294967296)) (.cse5 (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0)) (.cse6 (* c_main_~p~0 c_main_~h~0 c_main_~h~0)) (.cse7 (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4)) (.cse8 (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse3 (* v_y_6 4294967296)) (.cse0 (+ v_z_6 .cse9))) (or (< .cse0 .cse1) (< .cse2 (+ .cse3 v_z_6 1)) (< (+ .cse3 v_z_6) (mod (+ c_main_~p~0 .cse4) 4294967296)) (< v_z_6 0) (< 4294967295 .cse0) (not (= (mod (+ .cse5 (* c_main_~q~0 v_z_6 4 c_main_~h~0) .cse6 .cse7 (* 4294967292 c_main_~q~0 c_main_~p~0 v_z_6) .cse8) 4294967296) 0))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse10 (* v_y_6 4294967296))) (or (< 4294967295 v_z_6) (< .cse2 (+ .cse10 v_z_6 1)) (< (+ .cse10 v_z_6) 0) (< (+ v_z_6 .cse9) (+ 4294967296 .cse1)) (not (= (mod (+ .cse5 (* c_main_~q~0 v_z_6 4 c_main_~h~0) .cse6 .cse7 (* 4294967292 c_main_~q~0 c_main_~p~0 v_z_6) .cse8) 4294967296) 0)))))))) is different from false [2024-10-15 14:42:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755420689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:42:16,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:42:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-10-15 14:42:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689306181] [2024-10-15 14:42:16,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:42:16,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:42:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:42:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:42:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=4, NotChecked=44, Total=600 [2024-10-15 14:42:16,275 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 14:42:20,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:24,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:28,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:32,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:36,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:40,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:44,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:48,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []