./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74bed2c5921e53f16e234cbc0a2deaaf4b0b51c6cc3f20bfab2fd33a0fce7ecf --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:25:14,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:25:14,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:25:14,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:25:14,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:25:14,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:25:14,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:25:14,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:25:14,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:25:14,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:25:14,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:25:14,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:25:14,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:25:14,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:25:14,691 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:25:14,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:25:14,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:25:14,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:25:14,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:25:14,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:25:14,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:25:14,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:25:14,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:25:14,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:25:14,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:25:14,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:25:14,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:25:14,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:25:14,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:25:14,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:25:14,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:25:14,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:25:14,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:25:14,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:25:14,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:25:14,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:25:14,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:25:14,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:25:14,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:25:14,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:25:14,701 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:25:14,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:25:14,703 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 74bed2c5921e53f16e234cbc0a2deaaf4b0b51c6cc3f20bfab2fd33a0fce7ecf Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:25:14,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:25:14,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:25:14,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:25:14,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:25:14,982 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:25:14,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c [2024-09-24 23:25:16,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:25:16,621 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:25:16,621 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c [2024-09-24 23:25:16,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d552d6c02/a1e73614860e433d805dedc65c0618a3/FLAGa54005bdf [2024-09-24 23:25:16,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d552d6c02/a1e73614860e433d805dedc65c0618a3 [2024-09-24 23:25:16,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:25:16,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:25:16,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:25:16,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:25:16,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:25:16,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f39486e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16, skipping insertion in model container [2024-09-24 23:25:16,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:25:16,811 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2024-09-24 23:25:16,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:25:16,850 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:25:16,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2024-09-24 23:25:16,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:25:16,890 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:25:16,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16 WrapperNode [2024-09-24 23:25:16,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:25:16,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:25:16,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:25:16,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:25:16,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,911 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:25:16,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:25:16,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:25:16,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:25:16,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:25:16,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,941 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-24 23:25:16,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:25:16,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:25:16,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:25:16,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:25:16,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (1/1) ... [2024-09-24 23:25:16,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:25:16,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:16,982 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-24 23:25:16,985 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-24 23:25:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:25:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:25:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:25:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:25:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:25:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:25:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:25:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:25:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:25:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:25:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:25:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:25:17,080 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:25:17,082 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:25:17,295 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:25:17,295 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:25:17,314 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:25:17,318 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:25:17,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:17 BoogieIcfgContainer [2024-09-24 23:25:17,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:25:17,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:25:17,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:25:17,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:25:17,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:25:16" (1/3) ... [2024-09-24 23:25:17,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be7f9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:25:17, skipping insertion in model container [2024-09-24 23:25:17,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:25:16" (2/3) ... [2024-09-24 23:25:17,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be7f9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:25:17, skipping insertion in model container [2024-09-24 23:25:17,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:25:17" (3/3) ... [2024-09-24 23:25:17,327 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound10.c [2024-09-24 23:25:17,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:25:17,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:25:17,412 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:25:17,421 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;@478610d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:25:17,422 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:25:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-24 23:25:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-24 23:25:17,439 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:17,439 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:17,440 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:17,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-24 23:25:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:17,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997881250] [2024-09-24 23:25:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:17,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:17,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:17,621 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:25:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997881250] [2024-09-24 23:25:17,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997881250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:17,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:17,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:25:17,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556437618] [2024-09-24 23:25:17,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:17,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:25:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:25:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:25:17,669 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:25:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:17,722 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-24 23:25:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:25:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-24 23:25:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:17,738 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:25:17,740 INFO L226 Difference]: Without dead ends: 32 [2024-09-24 23:25:17,744 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:25:17,747 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:17,749 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:25:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-24 23:25:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-24 23:25:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-24 23:25:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-24 23:25:17,831 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-24 23:25:17,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:17,832 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-24 23:25:17,832 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-24 23:25:17,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-24 23:25:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-24 23:25:17,839 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:17,839 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:17,839 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:25:17,840 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:17,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-24 23:25:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133396662] [2024-09-24 23:25:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:18,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:18,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:18,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:25:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:18,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133396662] [2024-09-24 23:25:18,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133396662] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:18,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:25:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703507290] [2024-09-24 23:25:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:18,384 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:25:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:25:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:25:18,385 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:18,750 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-24 23:25:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:25:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-24 23:25:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:18,754 INFO L225 Difference]: With dead ends: 64 [2024-09-24 23:25:18,754 INFO L226 Difference]: Without dead ends: 46 [2024-09-24 23:25:18,755 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:25:18,756 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:18,758 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-24 23:25:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-24 23:25:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-24 23:25:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-24 23:25:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-24 23:25:18,785 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-24 23:25:18,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:18,785 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-24 23:25:18,785 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:18,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:18,786 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-24 23:25:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-24 23:25:18,788 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:18,789 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:18,789 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:25:18,789 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:18,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-24 23:25:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232669228] [2024-09-24 23:25:18,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:19,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:25:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:19,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:25:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:19,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:25:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232669228] [2024-09-24 23:25:19,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232669228] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:25:19,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978034927] [2024-09-24 23:25:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:19,170 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-24 23:25:19,171 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-24 23:25:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:19,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 23:25:19,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:19,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:25:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978034927] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:25:19,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:25:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-24 23:25:19,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85586153] [2024-09-24 23:25:19,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:25:19,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-24 23:25:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:19,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-24 23:25:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-24 23:25:19,595 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:21,690 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-09-24 23:25:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 23:25:21,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-24 23:25:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:21,694 INFO L225 Difference]: With dead ends: 115 [2024-09-24 23:25:21,695 INFO L226 Difference]: Without dead ends: 97 [2024-09-24 23:25:21,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-24 23:25:21,700 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:21,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-09-24 23:25:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-24 23:25:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-09-24 23:25:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-24 23:25:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-09-24 23:25:21,737 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-09-24 23:25:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:21,738 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-09-24 23:25:21,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-24 23:25:21,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-09-24 23:25:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-24 23:25:21,739 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:21,739 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:21,757 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:25:21,940 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:21,940 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:21,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-24 23:25:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236141216] [2024-09-24 23:25:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:21,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26659687] [2024-09-24 23:25:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:21,986 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-24 23:25:21,991 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-24 23:25:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:22,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:25:22,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-24 23:25:22,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:25:22,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236141216] [2024-09-24 23:25:22,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26659687] [2024-09-24 23:25:22,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26659687] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:25:22,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:25:22,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:25:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756806019] [2024-09-24 23:25:22,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:25:22,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:25:22,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:22,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:25:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:25:22,100 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:25:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:25:22,279 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-09-24 23:25:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:25:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-24 23:25:22,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:25:22,282 INFO L225 Difference]: With dead ends: 90 [2024-09-24 23:25:22,282 INFO L226 Difference]: Without dead ends: 87 [2024-09-24 23:25:22,282 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:25:22,283 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:25:22,284 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:25:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-24 23:25:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-24 23:25:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-24 23:25:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-09-24 23:25:22,301 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-09-24 23:25:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:25:22,302 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-09-24 23:25:22,302 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-24 23:25:22,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-09-24 23:25:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:25:22,303 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:25:22,304 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:25:22,322 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:25:22,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:22,508 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:25:22,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:25:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-24 23:25:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:25:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109633382] [2024-09-24 23:25:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:25:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:25:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085936750] [2024-09-24 23:25:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:25:22,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:25:22,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:25:22,543 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-24 23:25:22,546 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-24 23:25:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:25:22,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-24 23:25:22,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:25:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:22,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:25:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:25:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:25:26,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109633382] [2024-09-24 23:25:26,490 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:25:26,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085936750] [2024-09-24 23:25:26,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085936750] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:25:26,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:25:26,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-24 23:25:26,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842523163] [2024-09-24 23:25:26,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:25:26,492 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 23:25:26,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:25:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 23:25:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:25:26,493 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-24 23:25:40,265 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-24 23:25:41,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:25:43,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:25:48,163 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-24 23:25:49,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:25:54,923 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-24 23:25:59,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:03,427 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-24 23:26:07,440 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-24 23:26:11,455 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-24 23:26:15,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:19,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:23,501 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-24 23:26:27,506 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-24 23:26:32,104 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-24 23:26:36,924 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-24 23:26:39,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:26:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:26:39,610 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-09-24 23:26:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:26:39,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-09-24 23:26:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:26:39,612 INFO L225 Difference]: With dead ends: 156 [2024-09-24 23:26:39,612 INFO L226 Difference]: Without dead ends: 132 [2024-09-24 23:26:39,613 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-24 23:26:39,615 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 55 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.4s IncrementalHoareTripleChecker+Time [2024-09-24 23:26:39,615 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 200 Invalid, 13 Unknown, 0 Unchecked, 63.4s Time] [2024-09-24 23:26:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-24 23:26:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-09-24 23:26:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-24 23:26:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-09-24 23:26:39,644 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-09-24 23:26:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:26:39,644 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-09-24 23:26:39,645 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-24 23:26:39,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-09-24 23:26:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-24 23:26:39,647 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:26:39,647 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:26:39,654 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-24 23:26:39,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:39,848 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:26:39,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:26:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-09-24 23:26:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:26:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844085495] [2024-09-24 23:26:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:26:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:26:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:26:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:26:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:26:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-24 23:26:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 23:26:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-24 23:26:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-24 23:26:40,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:26:40,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844085495] [2024-09-24 23:26:40,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844085495] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:26:40,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447093386] [2024-09-24 23:26:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:26:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:26:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:26:40,074 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-24 23:26:40,075 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-24 23:26:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:26:40,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-24 23:26:40,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:26:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-24 23:26:40,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:26:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-24 23:26:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447093386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:26:40,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:26:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-09-24 23:26:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313871059] [2024-09-24 23:26:40,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:26:40,436 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-24 23:26:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:26:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-24 23:26:40,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-09-24 23:26:40,437 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-09-24 23:26:41,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:26:45,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:26:50,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:26:54,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:26:58,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:27:02,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:27:06,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:27:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:27:06,491 INFO L93 Difference]: Finished difference Result 177 states and 252 transitions. [2024-09-24 23:27:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 23:27:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 44 [2024-09-24 23:27:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:27:06,494 INFO L225 Difference]: With dead ends: 177 [2024-09-24 23:27:06,494 INFO L226 Difference]: Without dead ends: 135 [2024-09-24 23:27:06,497 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-09-24 23:27:06,498 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 84 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 180 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:27:06,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 245 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 26.0s Time] [2024-09-24 23:27:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-24 23:27:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2024-09-24 23:27:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-24 23:27:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 173 transitions. [2024-09-24 23:27:06,530 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 173 transitions. Word has length 44 [2024-09-24 23:27:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:27:06,531 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 173 transitions. [2024-09-24 23:27:06,531 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-09-24 23:27:06,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:27:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 173 transitions. [2024-09-24 23:27:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-24 23:27:06,533 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:27:06,534 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:27:06,550 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-24 23:27:06,735 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:27:06,735 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:27:06,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:27:06,735 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-24 23:27:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:27:06,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250570378] [2024-09-24 23:27:06,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:27:06,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:27:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:27:06,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056016492] [2024-09-24 23:27:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:27:06,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:27:06,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:27:06,788 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-24 23:27:06,790 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-24 23:27:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:06,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-24 23:27:06,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:27:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-24 23:27:07,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:27:11,245 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-24 23:27:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:27:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250570378] [2024-09-24 23:27:11,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:27:11,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056016492] [2024-09-24 23:27:11,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056016492] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:27:11,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:27:11,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-24 23:27:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544010847] [2024-09-24 23:27:11,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-24 23:27:11,253 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 23:27:11,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:27:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 23:27:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-24 23:27:11,253 INFO L87 Difference]: Start difference. First operand 123 states and 173 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-24 23:27:16,345 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-24 23:27:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:27:16,398 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2024-09-24 23:27:16,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:27:16,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-24 23:27:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:27:16,401 INFO L225 Difference]: With dead ends: 133 [2024-09-24 23:27:16,401 INFO L226 Difference]: Without dead ends: 111 [2024-09-24 23:27:16,401 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-24 23:27:16,402 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:27:16,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2024-09-24 23:27:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-24 23:27:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-09-24 23:27:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 50 states have call successors, (50), 10 states have call predecessors, (50), 9 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-09-24 23:27:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 154 transitions. [2024-09-24 23:27:16,440 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 154 transitions. Word has length 59 [2024-09-24 23:27:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:27:16,440 INFO L474 AbstractCegarLoop]: Abstraction has 111 states and 154 transitions. [2024-09-24 23:27:16,441 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-24 23:27:16,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:27:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 154 transitions. [2024-09-24 23:27:16,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-24 23:27:16,443 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:27:16,443 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:27:16,456 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-24 23:27:16,647 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-24 23:27:16,648 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:27:16,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:27:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-24 23:27:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:27:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391817576] [2024-09-24 23:27:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:27:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:27:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:27:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:27:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-24 23:27:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-24 23:27:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-24 23:27:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-24 23:27:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-24 23:27:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-24 23:27:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-24 23:27:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-24 23:27:17,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:27:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391817576] [2024-09-24 23:27:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391817576] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:27:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111255545] [2024-09-24 23:27:17,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:27:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:27:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:27:17,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:27:17,501 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-24 23:27:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:27:17,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-24 23:27:17,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:27:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-24 23:27:18,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:27:48,305 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-24 23:28:07,753 WARN L293 SmtUtils]: Spent 16.07s 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-24 23:28:24,012 WARN L293 SmtUtils]: Spent 8.08s 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-24 23:28:34,011 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:28:42,067 WARN L293 SmtUtils]: Spent 8.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-24 23:28:54,571 WARN L293 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-24 23:29:07,157 WARN L293 SmtUtils]: Spent 8.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-24 23:29:15,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (div (mod c_main_~q~0 4294967296) 4))) (let ((.cse2 (mod (+ (* 2 c_main_~p~0) c_main_~q~0) 4294967296)) (.cse9 (mod (+ (* 4294967295 .cse4) (* 4294967295 c_main_~p~0)) 4294967296)) (.cse1 (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse4) c_main_~p~0) 4294967296)) (.cse5 (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0)) (.cse6 (* c_main_~p~0 c_main_~h~0 c_main_~h~0)) (.cse7 (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4)) (.cse8 (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse3 (* v_y_6 4294967296)) (.cse0 (+ v_z_6 .cse9))) (or (< .cse0 .cse1) (< .cse2 (+ .cse3 v_z_6 1)) (< (+ .cse3 v_z_6) (mod (+ c_main_~p~0 .cse4) 4294967296)) (< v_z_6 0) (< 4294967295 .cse0) (not (= (mod (+ .cse5 (* c_main_~q~0 v_z_6 4 c_main_~h~0) .cse6 .cse7 (* 4294967292 c_main_~q~0 c_main_~p~0 v_z_6) .cse8) 4294967296) 0))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse10 (* v_y_6 4294967296))) (or (< 4294967295 v_z_6) (< .cse2 (+ .cse10 v_z_6 1)) (< (+ .cse10 v_z_6) 0) (< (+ v_z_6 .cse9) (+ 4294967296 .cse1)) (not (= (mod (+ .cse5 (* c_main_~q~0 v_z_6 4 c_main_~h~0) .cse6 .cse7 (* 4294967292 c_main_~q~0 c_main_~p~0 v_z_6) .cse8) 4294967296) 0)))))))) is different from false [2024-09-24 23:29:15,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111255545] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:29:15,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:29:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-24 23:29:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445417558] [2024-09-24 23:29:15,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:29:15,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-24 23:29:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:29:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-24 23:29:15,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=473, Unknown=3, NotChecked=44, Total=600 [2024-09-24 23:29:15,478 INFO L87 Difference]: Start difference. First operand 111 states and 154 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-24 23:29:17,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-24 23:29:22,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:26,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:30,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:34,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:38,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:42,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:46,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:50,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-24 23:29:54,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []