./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.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 3969c56ba3ed63965cbeb782ee88e7216b6985c490408396983bf5f457467675 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 01:57:25,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:57:26,001 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:57:26,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:57:26,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:57:26,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:57:26,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:57:26,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:57:26,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:57:26,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:57:26,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:57:26,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:57:26,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:57:26,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:57:26,026 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:57:26,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:57:26,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:57:26,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:57:26,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:57:26,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:57:26,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:57:26,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:57:26,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:57:26,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:57:26,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:57:26,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:57:26,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:57:26,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:57:26,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:57:26,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:57:26,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:57:26,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:57:26,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:57:26,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:57:26,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:57:26,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:57:26,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:57:26,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:57:26,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:57:26,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:57:26,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:57:26,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:57:26,034 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 -> 3969c56ba3ed63965cbeb782ee88e7216b6985c490408396983bf5f457467675 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 01:57:26,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:57:26,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:57:26,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:57:26,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:57:26,249 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:57:26,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.c [2024-09-13 01:57:27,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:57:27,540 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:57:27,540 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.c [2024-09-13 01:57:27,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7bb6376c3/fe780248a5b44ef1ad310c8d28196551/FLAGa93e574df [2024-09-13 01:57:27,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7bb6376c3/fe780248a5b44ef1ad310c8d28196551 [2024-09-13 01:57:27,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:57:27,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:57:27,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:57:27,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:57:27,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:57:27,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:57:27" (1/1) ... [2024-09-13 01:57:27,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e9a090c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:27, skipping insertion in model container [2024-09-13 01:57:27,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:57:27" (1/1) ... [2024-09-13 01:57:27,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:57:28,065 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.c[537,550] [2024-09-13 01:57:28,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:57:28,082 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:57:28,090 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound2.c[537,550] [2024-09-13 01:57:28,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:57:28,111 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:57:28,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28 WrapperNode [2024-09-13 01:57:28,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:57:28,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:57:28,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:57:28,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:57:28,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,127 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:57:28,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:57:28,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:57:28,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:57:28,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:57:28,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,143 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 01:57:28,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:57:28,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:57:28,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:57:28,151 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:57:28,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (1/1) ... [2024-09-13 01:57:28,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:57:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:57:28,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 01:57:28,177 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 01:57:28,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:57:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 01:57:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 01:57:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:57:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:57:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:57:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:57:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:57:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:57:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:57:28,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:57:28,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:57:28,252 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:57:28,254 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:57:28,412 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 01:57:28,413 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:57:28,429 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:57:28,430 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 01:57:28,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:57:28 BoogieIcfgContainer [2024-09-13 01:57:28,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:57:28,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:57:28,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:57:28,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:57:28,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:57:27" (1/3) ... [2024-09-13 01:57:28,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ae74f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:57:28, skipping insertion in model container [2024-09-13 01:57:28,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:57:28" (2/3) ... [2024-09-13 01:57:28,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ae74f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:57:28, skipping insertion in model container [2024-09-13 01:57:28,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:57:28" (3/3) ... [2024-09-13 01:57:28,438 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound2.c [2024-09-13 01:57:28,450 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:57:28,450 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:57:28,493 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:57:28,497 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@31147e4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:57:28,497 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:57:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 01:57:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:57:28,509 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:28,509 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:28,509 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:28,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-13 01:57:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:28,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579613543] [2024-09-13 01:57:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:57:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:57:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:57:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:57:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:57:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579613543] [2024-09-13 01:57:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579613543] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:57:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:57:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 01:57:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208105239] [2024-09-13 01:57:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:57:28,667 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 01:57:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 01:57:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:57:28,686 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:57:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:28,716 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-13 01:57:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 01:57:28,718 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-13 01:57:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:28,723 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:57:28,724 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 01:57:28,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:57:28,731 INFO L434 NwaCegarLoop]: 44 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, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:28,732 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:57:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 01:57:28,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 01:57:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:57:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-13 01:57:28,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-13 01:57:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:28,769 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-13 01:57:28,770 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:57:28,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-13 01:57:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:57:28,772 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:28,773 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:28,773 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:57:28,773 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:28,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-13 01:57:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028379041] [2024-09-13 01:57:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:57:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:57:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:28,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:57:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:57:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:57:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028379041] [2024-09-13 01:57:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028379041] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:57:29,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:57:29,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:57:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76015125] [2024-09-13 01:57:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:57:29,014 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:57:29,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:29,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:57:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:57:29,016 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:57:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:29,079 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-13 01:57:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:57:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-13 01:57:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:29,081 INFO L225 Difference]: With dead ends: 45 [2024-09-13 01:57:29,081 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 01:57:29,081 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:57:29,083 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:29,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:57:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 01:57:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-13 01:57:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:57:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-13 01:57:29,092 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-13 01:57:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:29,093 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-13 01:57:29,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:57:29,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-13 01:57:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 01:57:29,094 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:29,094 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:29,094 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 01:57:29,095 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:29,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-13 01:57:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:29,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059379396] [2024-09-13 01:57:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:57:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:57:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:57:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:57:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:57:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:57:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059379396] [2024-09-13 01:57:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059379396] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:57:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:57:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:57:29,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898270393] [2024-09-13 01:57:29,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:57:29,384 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:57:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:57:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:57:29,386 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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-09-13 01:57:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:29,483 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-13 01:57:29,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:57:29,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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 32 [2024-09-13 01:57:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:29,488 INFO L225 Difference]: With dead ends: 49 [2024-09-13 01:57:29,488 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 01:57:29,488 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:57:29,489 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:29,489 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:57:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 01:57:29,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-13 01:57:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:57:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-13 01:57:29,500 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-13 01:57:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:29,501 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-13 01:57:29,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (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-09-13 01:57:29,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-13 01:57:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 01:57:29,502 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:29,502 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:29,502 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 01:57:29,502 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:29,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-13 01:57:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786553654] [2024-09-13 01:57:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:57:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443991214] [2024-09-13 01:57:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:57:29,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:57:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 01:57:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:29,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 01:57:29,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:57:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 01:57:29,705 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:57:29,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:29,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786553654] [2024-09-13 01:57:29,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:57:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443991214] [2024-09-13 01:57:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443991214] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:57:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:57:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-13 01:57:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077314376] [2024-09-13 01:57:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:57:29,707 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 01:57:29,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:29,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 01:57:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-13 01:57:29,708 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 01:57:29,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:29,930 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-13 01:57:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 01:57:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-09-13 01:57:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:29,931 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:57:29,932 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 01:57:29,932 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-13 01:57:29,933 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:29,933 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:57:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 01:57:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 01:57:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 01:57:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-13 01:57:29,950 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-13 01:57:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:29,951 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-13 01:57:29,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 01:57:29,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-13 01:57:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 01:57:29,952 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:29,952 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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-09-13 01:57:29,965 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 01:57:30,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:30,152 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:30,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-13 01:57:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:30,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783447310] [2024-09-13 01:57:30,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:30,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:57:30,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440843691] [2024-09-13 01:57:30,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:57:30,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:57:30,178 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 01:57:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:30,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 01:57:30,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:57:30,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:57:30,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:57:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 01:57:31,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783447310] [2024-09-13 01:57:31,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:57:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440843691] [2024-09-13 01:57:31,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440843691] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:57:31,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:57:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-13 01:57:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863532808] [2024-09-13 01:57:31,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:57:31,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 01:57:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 01:57:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-13 01:57:31,237 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-13 01:57:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:31,602 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-13 01:57:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 01:57:31,603 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-09-13 01:57:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:31,605 INFO L225 Difference]: With dead ends: 71 [2024-09-13 01:57:31,605 INFO L226 Difference]: Without dead ends: 63 [2024-09-13 01:57:31,605 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-13 01:57:31,606 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:31,606 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:57:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-13 01:57:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-13 01:57:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 01:57:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-09-13 01:57:31,629 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-09-13 01:57:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:31,629 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-09-13 01:57:31,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-13 01:57:31,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-09-13 01:57:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 01:57:31,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:31,630 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:31,643 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 01:57:31,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:31,836 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:31,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-13 01:57:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273890965] [2024-09-13 01:57:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:57:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [731729601] [2024-09-13 01:57:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:31,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:57:31,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:57:31,874 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 01:57:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:31,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 01:57:31,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:57:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 01:57:32,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:57:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 01:57:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273890965] [2024-09-13 01:57:32,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:57:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731729601] [2024-09-13 01:57:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731729601] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 01:57:32,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 01:57:32,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-09-13 01:57:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324867110] [2024-09-13 01:57:32,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:57:32,111 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 01:57:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 01:57:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-13 01:57:32,111 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 01:57:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:32,529 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-09-13 01:57:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:57:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2024-09-13 01:57:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:32,531 INFO L225 Difference]: With dead ends: 73 [2024-09-13 01:57:32,531 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 01:57:32,531 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-13 01:57:32,532 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:32,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 01:57:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 01:57:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-13 01:57:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-13 01:57:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-09-13 01:57:32,551 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 54 [2024-09-13 01:57:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:32,551 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-09-13 01:57:32,553 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-13 01:57:32,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-09-13 01:57:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-13 01:57:32,557 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:32,557 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:32,563 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 01:57:32,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 01:57:32,758 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:32,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -752924724, now seen corresponding path program 1 times [2024-09-13 01:57:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065456186] [2024-09-13 01:57:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:57:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:57:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:57:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:57:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:57:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:57:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:57:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:57:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:57:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:57:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:57:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:57:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 01:57:32,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:57:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065456186] [2024-09-13 01:57:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065456186] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:57:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681881755] [2024-09-13 01:57:32,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:32,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:32,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:57:32,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:57:32,893 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 01:57:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:32,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 01:57:32,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:57:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-13 01:57:33,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:57:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681881755] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:57:33,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:57:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-09-13 01:57:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135572337] [2024-09-13 01:57:33,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:57:33,072 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 01:57:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:57:33,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 01:57:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-13 01:57:33,074 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-13 01:57:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:57:33,355 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-09-13 01:57:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 01:57:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 72 [2024-09-13 01:57:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:57:33,357 INFO L225 Difference]: With dead ends: 102 [2024-09-13 01:57:33,357 INFO L226 Difference]: Without dead ends: 94 [2024-09-13 01:57:33,358 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-13 01:57:33,358 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:57:33,359 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 232 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:57:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-13 01:57:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-09-13 01:57:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-13 01:57:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-13 01:57:33,391 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 72 [2024-09-13 01:57:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:57:33,391 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-13 01:57:33,391 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-13 01:57:33,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-13 01:57:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-13 01:57:33,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:57:33,392 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:57:33,406 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 01:57:33,592 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:33,593 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:57:33,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:57:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-13 01:57:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:57:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839814594] [2024-09-13 01:57:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:57:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:57:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1241411746] [2024-09-13 01:57:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:57:33,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:57:33,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:57:33,622 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-09-13 01:57:33,622 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 01:57:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:57:33,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-13 01:57:33,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:57:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-13 01:57:34,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:58:11,937 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:58:33,080 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:59:47,168 WARN L293 SmtUtils]: Spent 36.40s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:59:57,508 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:00:06,519 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:00:34,799 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:00:50,977 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:01:15,029 WARN L293 SmtUtils]: Spent 24.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:01:31,071 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:01:35,078 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse4 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse5 (mod c_main_~p~0 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< .cse3 .cse4) (= .cse5 1) (= .cse0 (mod (+ (* 4294967295 .cse4) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse5 2))) 4294967296)) (< .cse2 (+ 1 .cse3))))) is different from true [2024-09-13 02:01:51,316 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:02:22,234 WARN L293 SmtUtils]: Spent 22.86s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:02:38,251 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:02:54,430 WARN L293 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:03:07,181 WARN L293 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:03:27,251 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:03:51,293 WARN L293 SmtUtils]: Spent 24.04s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:04:07,324 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:04:11,355 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse4 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse5 (mod c_main_~p~0 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (not (= .cse0 .cse3)) (< .cse3 .cse4) (= .cse5 1) (= .cse0 (mod (+ (* 4294967295 .cse4) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse5 2))) 4294967296)) (< .cse2 (+ 1 .cse3))))) is different from true [2024-09-13 02:04:47,665 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:04:59,751 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:05:12,032 WARN L293 SmtUtils]: Spent 7.73s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:05:19,316 WARN L293 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:05:39,408 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:05:48,968 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:06:01,424 WARN L293 SmtUtils]: Spent 12.46s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:06:09,880 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:06:25,905 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:07:44,000 WARN L293 SmtUtils]: Spent 20.25s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:07:49,771 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:08:07,502 WARN L293 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:08:29,582 WARN L293 SmtUtils]: Spent 7.30s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:08:51,232 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~B~0 2147483648)) (.cse0 (mod c_main_~A~0 4294967296))) (or (< .cse0 (mod c_main_~B~0 4294967296)) (= (mod (+ (* .cse1 4294967295) c_main_~A~0 c_main_~B~0) 4294967296) .cse0) (< (* .cse1 2) (+ .cse0 1)))) is different from true [2024-09-13 02:08:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 13 refuted. 2 times theorem prover too weak. 76 trivial. 5 not checked. [2024-09-13 02:08:51,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 02:08:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839814594] [2024-09-13 02:08:51,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 02:08:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241411746] [2024-09-13 02:08:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241411746] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 02:08:51,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 02:08:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2024-09-13 02:08:51,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20786275] [2024-09-13 02:08:51,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 02:08:51,374 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 02:08:51,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 02:08:51,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 02:08:51,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=437, Unknown=21, NotChecked=138, Total=702 [2024-09-13 02:08:51,375 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 13 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 14 states have call predecessors, (23), 11 states have call successors, (23) [2024-09-13 02:08:55,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-13 02:08:59,747 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-09-13 02:09:04,616 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-09-13 02:09:08,809 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-09-13 02:09:12,822 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-09-13 02:09:16,832 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-09-13 02:09:20,887 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-09-13 02:09:23,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:09:27,149 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-09-13 02:09:31,169 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-09-13 02:09:35,177 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-09-13 02:09:39,286 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-09-13 02:09:45,165 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-09-13 02:09:49,182 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-09-13 02:09:55,240 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-09-13 02:10:58,957 WARN L293 SmtUtils]: Spent 57.45s on a formula simplification. DAG size of input: 68 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:11:02,970 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-09-13 02:11:13,688 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-09-13 02:11:17,827 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 [] Killed by 15