./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.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 ec2a850a3cd9252437037b0e2bf289d9622078bb11b0dcb40fb1cb3d7147f7c5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:38:17,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:38:17,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:38:17,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:38:17,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:38:17,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:38:17,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:38:17,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:38:17,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:38:17,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:38:17,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:38:17,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:38:17,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:38:17,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:38:17,730 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:38:17,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:38:17,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:38:17,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:38:17,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:38:17,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:38:17,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:38:17,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:38:17,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:38:17,735 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:38:17,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:38:17,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:38:17,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:38:17,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:38:17,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:38:17,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:38:17,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:38:17,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:38:17,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:38:17,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:38:17,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:38:17,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:38:17,737 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 -> ec2a850a3cd9252437037b0e2bf289d9622078bb11b0dcb40fb1cb3d7147f7c5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:38:17,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:38:17,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:38:17,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:38:17,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:38:17,950 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:38:17,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c [2024-10-15 14:38:19,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:38:19,380 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:38:19,381 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c [2024-10-15 14:38:19,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/375efe9a7/bfb130ce773e429c85a3833d65e9e7e0/FLAGac93d8c11 [2024-10-15 14:38:19,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/375efe9a7/bfb130ce773e429c85a3833d65e9e7e0 [2024-10-15 14:38:19,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:38:19,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:38:19,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:38:19,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:38:19,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:38:19,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6ebdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19, skipping insertion in model container [2024-10-15 14:38:19,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:38:19,575 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_valuebound20.c[525,538] [2024-10-15 14:38:19,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:38:19,675 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:38:19,684 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_valuebound20.c[525,538] [2024-10-15 14:38:19,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:38:19,713 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:38:19,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19 WrapperNode [2024-10-15 14:38:19,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:38:19,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:38:19,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:38:19,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:38:19,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,733 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:38:19,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:38:19,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:38:19,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:38:19,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:38:19,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,754 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 14:38:19,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:38:19,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:38:19,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:38:19,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:38:19,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (1/1) ... [2024-10-15 14:38:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:38:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:19,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:38:19,794 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:38:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:38:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:38:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:38:19,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:38:19,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:38:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:38:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:38:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:38:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:38:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:38:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:38:19,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:38:19,872 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:38:19,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:38:20,037 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 14:38:20,037 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:38:20,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:38:20,051 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:38:20,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:38:20 BoogieIcfgContainer [2024-10-15 14:38:20,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:38:20,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:38:20,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:38:20,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:38:20,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:38:19" (1/3) ... [2024-10-15 14:38:20,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd9298b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:38:20, skipping insertion in model container [2024-10-15 14:38:20,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:38:19" (2/3) ... [2024-10-15 14:38:20,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd9298b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:38:20, skipping insertion in model container [2024-10-15 14:38:20,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:38:20" (3/3) ... [2024-10-15 14:38:20,061 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound20.c [2024-10-15 14:38:20,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:38:20,073 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:38:20,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:38:20,114 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15e3db98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:38:20,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:38:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-15 14:38:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:38:20,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:20,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:20,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-10-15 14:38:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363140178] [2024-10-15 14:38:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:38:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:38:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:38:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363140178] [2024-10-15 14:38:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363140178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:38:20,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:38:20,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:38:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551623888] [2024-10-15 14:38:20,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:38:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:38:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:38:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:38:20,274 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:38:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:20,300 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-10-15 14:38:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:38:20,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-10-15 14:38:20,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:20,308 INFO L225 Difference]: With dead ends: 66 [2024-10-15 14:38:20,308 INFO L226 Difference]: Without dead ends: 32 [2024-10-15 14:38:20,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:38:20,313 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:20,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:38:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-15 14:38:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-15 14:38:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-15 14:38:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-10-15 14:38:20,340 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-10-15 14:38:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:20,340 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-10-15 14:38:20,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-15 14:38:20,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-10-15 14:38:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-15 14:38:20,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:20,342 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:20,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:38:20,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:20,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:20,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-10-15 14:38:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:20,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49084831] [2024-10-15 14:38:20,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:20,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:38:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:38:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:38:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49084831] [2024-10-15 14:38:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49084831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:38:20,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:38:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 14:38:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835075617] [2024-10-15 14:38:20,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:38:20,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 14:38:20,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 14:38:20,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:38:20,752 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:21,020 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-10-15 14:38:21,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:38:21,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-15 14:38:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:21,022 INFO L225 Difference]: With dead ends: 64 [2024-10-15 14:38:21,023 INFO L226 Difference]: Without dead ends: 46 [2024-10-15 14:38:21,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:38:21,025 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:21,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:38:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-15 14:38:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-15 14:38:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-15 14:38:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-10-15 14:38:21,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-10-15 14:38:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:21,047 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-10-15 14:38:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-10-15 14:38:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-15 14:38:21,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:21,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:21,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:38:21,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:21,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-10-15 14:38:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:21,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232402205] [2024-10-15 14:38:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:21,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:38:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:38:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:38:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:21,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232402205] [2024-10-15 14:38:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232402205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:38:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909656679] [2024-10-15 14:38:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:21,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:21,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:38:21,332 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:38:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:21,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 14:38:21,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:38:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:21,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:38:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909656679] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:38:21,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:38:21,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-15 14:38:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418589780] [2024-10-15 14:38:21,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:38:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-15 14:38:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-15 14:38:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:38:21,646 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:23,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:23,397 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-10-15 14:38:23,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:38:23,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-15 14:38:23,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:23,400 INFO L225 Difference]: With dead ends: 115 [2024-10-15 14:38:23,400 INFO L226 Difference]: Without dead ends: 97 [2024-10-15 14:38:23,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-10-15 14:38:23,401 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:23,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-15 14:38:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-15 14:38:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-10-15 14:38:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-15 14:38:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-10-15 14:38:23,415 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-10-15 14:38:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:23,415 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-10-15 14:38:23,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-15 14:38:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-10-15 14:38:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-15 14:38:23,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:23,417 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:23,429 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:38:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:23,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:23,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-10-15 14:38:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:23,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997674789] [2024-10-15 14:38:23,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:38:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246791262] [2024-10-15 14:38:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:23,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:38:23,649 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:38:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:23,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 14:38:23,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:38:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-15 14:38:23,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:38:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997674789] [2024-10-15 14:38:23,728 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:38:23,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246791262] [2024-10-15 14:38:23,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246791262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:38:23,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:38:23,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:38:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130539144] [2024-10-15 14:38:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:38:23,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:38:23,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:23,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:38:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:38:23,730 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:38:23,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:38:23,852 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-10-15 14:38:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:38:23,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-10-15 14:38:23,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:38:23,854 INFO L225 Difference]: With dead ends: 90 [2024-10-15 14:38:23,854 INFO L226 Difference]: Without dead ends: 87 [2024-10-15 14:38:23,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-15 14:38:23,855 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:38:23,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:38:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-15 14:38:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-15 14:38:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-15 14:38:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-15 14:38:23,873 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-10-15 14:38:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:38:23,873 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-15 14:38:23,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-15 14:38:23,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-15 14:38:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-15 14:38:23,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:38:23,874 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:38:23,887 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:38:24,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:24,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:38:24,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:38:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-10-15 14:38:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:38:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941958161] [2024-10-15 14:38:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:38:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:38:24,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1903729019] [2024-10-15 14:38:24,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:38:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:38:24,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:38:24,099 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:38:24,101 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:38:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:38:24,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-15 14:38:24,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:38:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:24,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:38:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 14:38:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:38:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941958161] [2024-10-15 14:38:27,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:38:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903729019] [2024-10-15 14:38:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903729019] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:38:27,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:38:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-10-15 14:38:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20032285] [2024-10-15 14:38:27,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:38:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:38:27,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:38:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:38:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:38:27,683 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 14:38:44,779 WARN L286 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 29 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 14:38:48,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:54,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:38:59,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:03,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:07,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:11,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:15,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:19,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:23,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:27,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-10-15 14:39:31,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:35,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:39,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:43,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:48,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:52,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:53,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:57,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:39:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:39:57,590 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-10-15 14:39:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:39:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-10-15 14:39:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:39:57,592 INFO L225 Difference]: With dead ends: 156 [2024-10-15 14:39:57,592 INFO L226 Difference]: Without dead ends: 132 [2024-10-15 14:39:57,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:39:57,593 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 55 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:39:57,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 199 Invalid, 17 Unknown, 0 Unchecked, 72.9s Time] [2024-10-15 14:39:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-15 14:39:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-10-15 14:39:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-15 14:39:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-10-15 14:39:57,627 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-10-15 14:39:57,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:39:57,628 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-10-15 14:39:57,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 14:39:57,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-10-15 14:39:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-15 14:39:57,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:39:57,630 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:39:57,636 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:39:57,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:57,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:39:57,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:57,834 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-10-15 14:39:57,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:39:57,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331128009] [2024-10-15 14:39:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:57,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:39:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:39:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133421550] [2024-10-15 14:39:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:57,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:57,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:39:57,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:39:57,863 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:39:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:57,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:39:57,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:39:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 14:39:58,047 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:39:58,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:39:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331128009] [2024-10-15 14:39:58,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:39:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133421550] [2024-10-15 14:39:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133421550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:39:58,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:39:58,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-15 14:39:58,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843375479] [2024-10-15 14:39:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:39:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:39:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:39:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:39:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:39:58,051 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:39:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:39:58,660 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-10-15 14:39:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:39:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-10-15 14:39:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:39:58,663 INFO L225 Difference]: With dead ends: 140 [2024-10-15 14:39:58,663 INFO L226 Difference]: Without dead ends: 138 [2024-10-15 14:39:58,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:39:58,664 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:39:58,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 256 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 14:39:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-15 14:39:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-15 14:39:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 67 states have (on average 1.164179104477612) internal successors, (78), 70 states have internal predecessors, (78), 57 states have call successors, (57), 14 states have call predecessors, (57), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-15 14:39:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-10-15 14:39:58,691 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 44 [2024-10-15 14:39:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:39:58,698 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-10-15 14:39:58,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-15 14:39:58,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-10-15 14:39:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-15 14:39:58,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:39:58,701 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:39:58,714 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 14:39:58,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:58,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:39:58,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:39:58,902 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-10-15 14:39:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:39:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364632831] [2024-10-15 14:39:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:39:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-15 14:39:58,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605135653] [2024-10-15 14:39:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:39:58,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:39:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:39:58,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:39:58,941 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:39:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:39:58,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 14:39:58,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:39:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-15 14:39:59,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:40:07,905 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-10-15 14:40:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:40:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364632831] [2024-10-15 14:40:07,914 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-15 14:40:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605135653] [2024-10-15 14:40:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605135653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:40:07,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:40:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-15 14:40:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266452140] [2024-10-15 14:40:07,915 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-15 14:40:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:40:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:40:07,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:40:07,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-10-15 14:40:07,916 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-15 14:40:12,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:40:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:40:12,886 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2024-10-15 14:40:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:40:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-10-15 14:40:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:40:12,888 INFO L225 Difference]: With dead ends: 156 [2024-10-15 14:40:12,888 INFO L226 Difference]: Without dead ends: 138 [2024-10-15 14:40:12,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-10-15 14:40:12,889 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:40:12,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 121 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-10-15 14:40:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-15 14:40:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-15 14:40:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 56 states have call successors, (56), 14 states have call predecessors, (56), 13 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-15 14:40:12,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-10-15 14:40:12,912 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 59 [2024-10-15 14:40:12,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:40:12,912 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-10-15 14:40:12,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-15 14:40:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:40:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-10-15 14:40:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-15 14:40:12,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:40:12,919 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:40:12,932 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-15 14:40:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:40:13,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:40:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:40:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-10-15 14:40:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:40:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425939906] [2024-10-15 14:40:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:40:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:40:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:40:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:40:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:40:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 14:40:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-15 14:40:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-15 14:40:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-15 14:40:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:40:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-15 14:40:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-15 14:40:13,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:40:13,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425939906] [2024-10-15 14:40:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425939906] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:40:13,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753629784] [2024-10-15 14:40:13,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:40:13,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:40:13,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:40:13,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:40:13,782 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:40:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:40:13,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-15 14:40:13,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:40:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 14:40:14,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:40:50,813 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:40:59,291 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:41:16,229 WARN L286 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-15 14:41:20,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (mod c_main_~q~0 4294967296))) (or (let ((.cse4 (div .cse11 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)))))))) (= .cse11 1))) is different from false [2024-10-15 14:41:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753629784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:41:20,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:41:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-10-15 14:41:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800202398] [2024-10-15 14:41:20,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:41:20,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 14:41:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:41:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 14:41:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=465, Unknown=2, NotChecked=44, Total=600 [2024-10-15 14:41:20,282 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 14:41:24,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:25,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:26,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:31,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:41:35,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:39,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:43,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:47,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:41:51,977 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-10-15 14:41:55,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:00,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:04,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-10-15 14:42:08,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:12,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:16,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:42:20,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-15 14:42:24,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:28,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:32,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-15 14:42:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:42:32,499 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2024-10-15 14:42:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:42:32,501 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 58 [2024-10-15 14:42:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:42:32,502 INFO L225 Difference]: With dead ends: 182 [2024-10-15 14:42:32,502 INFO L226 Difference]: Without dead ends: 151 [2024-10-15 14:42:32,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=129, Invalid=685, Unknown=2, NotChecked=54, Total=870 [2024-10-15 14:42:32,503 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 21 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:42:32,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 459 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 421 Invalid, 17 Unknown, 0 Unchecked, 72.0s Time] [2024-10-15 14:42:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-15 14:42:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-10-15 14:42:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.1282051282051282) internal successors, (88), 80 states have internal predecessors, (88), 56 states have call successors, (56), 17 states have call predecessors, (56), 16 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-15 14:42:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2024-10-15 14:42:32,530 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 58 [2024-10-15 14:42:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:42:32,534 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2024-10-15 14:42:32,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-10-15 14:42:32,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:42:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2024-10-15 14:42:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-15 14:42:32,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:42:32,535 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 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] [2024-10-15 14:42:32,548 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-15 14:42:32,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:42:32,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:42:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:42:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1682429464, now seen corresponding path program 2 times [2024-10-15 14:42:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:42:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046342042] [2024-10-15 14:42:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:42:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:42:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:42:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 14:42:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-15 14:42:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-15 14:42:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-15 14:42:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 14:42:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-15 14:42:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 14:42:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-15 14:42:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:42:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-15 14:42:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:42:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046342042] [2024-10-15 14:42:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046342042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:42:33,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072338993] [2024-10-15 14:42:33,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:42:33,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:42:33,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:42:33,670 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:42:33,671 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 14:42:33,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:42:33,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:42:33,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-15 14:42:33,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:42:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-15 14:42:34,895 INFO L311 TraceCheckSpWp]: Computing backward predicates...