./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 de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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.4-tmp.dk.referee-eval-de32597-m [2024-09-18 15:58:10,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-18 15:58:10,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-18 15:58:10,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-18 15:58:10,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-18 15:58:10,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-18 15:58:10,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-18 15:58:10,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-18 15:58:10,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-18 15:58:10,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-18 15:58:10,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-18 15:58:10,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-18 15:58:10,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-18 15:58:10,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-18 15:58:10,891 INFO L153 SettingsManager]: * Use SBE=true [2024-09-18 15:58:10,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-18 15:58:10,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-18 15:58:10,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-18 15:58:10,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-18 15:58:10,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-18 15:58:10,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-18 15:58:10,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-18 15:58:10,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-18 15:58:10,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-18 15:58:10,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-18 15:58:10,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-18 15:58:10,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-18 15:58:10,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-18 15:58:10,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-18 15:58:10,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-18 15:58:10,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-18 15:58:10,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-18 15:58:10,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:58:10,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-18 15:58:10,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-18 15:58:10,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-18 15:58:10,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-18 15:58:10,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-18 15:58:10,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-18 15:58:10,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-18 15:58:10,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-18 15:58:10,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-18 15:58:10,904 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-09-18 15:58:11,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-18 15:58:11,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-18 15:58:11,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-18 15:58:11,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-18 15:58:11,168 INFO L274 PluginConnector]: CDTParser initialized [2024-09-18 15:58:11,169 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-09-18 15:58:12,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-18 15:58:12,761 INFO L384 CDTParser]: Found 1 translation units. [2024-09-18 15:58:12,762 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound20.c [2024-09-18 15:58:12,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b9cdb6c21/96df3086646f4fe39f46b4c45c259293/FLAGb76f9dba1 [2024-09-18 15:58:12,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b9cdb6c21/96df3086646f4fe39f46b4c45c259293 [2024-09-18 15:58:12,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-18 15:58:12,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-18 15:58:12,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-18 15:58:12,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-18 15:58:12,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-18 15:58:12,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:58:12" (1/1) ... [2024-09-18 15:58:12,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ece2965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:12, skipping insertion in model container [2024-09-18 15:58:12,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 03:58:12" (1/1) ... [2024-09-18 15:58:12,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-18 15:58:12,942 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-09-18 15:58:12,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:58:12,978 INFO L200 MainTranslator]: Completed pre-run [2024-09-18 15:58:12,989 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-09-18 15:58:13,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-18 15:58:13,055 INFO L204 MainTranslator]: Completed translation [2024-09-18 15:58:13,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13 WrapperNode [2024-09-18 15:58:13,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-18 15:58:13,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-18 15:58:13,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-18 15:58:13,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-18 15:58:13,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,081 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,087 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-18 15:58:13,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-18 15:58:13,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-18 15:58:13,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-18 15:58:13,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-18 15:58:13,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,121 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-18 15:58:13,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-18 15:58:13,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-18 15:58:13,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-18 15:58:13,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-18 15:58:13,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (1/1) ... [2024-09-18 15:58:13,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-18 15:58:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:58:13,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-18 15:58:13,169 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-18 15:58:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-18 15:58:13,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-18 15:58:13,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-18 15:58:13,212 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-18 15:58:13,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-18 15:58:13,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-18 15:58:13,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-18 15:58:13,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-18 15:58:13,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-18 15:58:13,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-18 15:58:13,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-18 15:58:13,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-18 15:58:13,275 INFO L242 CfgBuilder]: Building ICFG [2024-09-18 15:58:13,277 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-18 15:58:13,526 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-18 15:58:13,526 INFO L291 CfgBuilder]: Performing block encoding [2024-09-18 15:58:13,555 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-18 15:58:13,555 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-18 15:58:13,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:58:13 BoogieIcfgContainer [2024-09-18 15:58:13,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-18 15:58:13,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-18 15:58:13,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-18 15:58:13,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-18 15:58:13,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 03:58:12" (1/3) ... [2024-09-18 15:58:13,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e1ec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:58:13, skipping insertion in model container [2024-09-18 15:58:13,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 03:58:13" (2/3) ... [2024-09-18 15:58:13,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e1ec15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 03:58:13, skipping insertion in model container [2024-09-18 15:58:13,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 03:58:13" (3/3) ... [2024-09-18 15:58:13,567 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound20.c [2024-09-18 15:58:13,582 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-18 15:58:13,583 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-18 15:58:13,632 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-18 15:58:13,637 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@58354d4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-18 15:58:13,637 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-18 15:58:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-18 15:58:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-18 15:58:13,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:58:13,647 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:58:13,647 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:58:13,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 570623365, now seen corresponding path program 1 times [2024-09-18 15:58:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:58:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100940413] [2024-09-18 15:58:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:58:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:13,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:58:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:13,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:58:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:13,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-18 15:58:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:13,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:58:13,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100940413] [2024-09-18 15:58:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100940413] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:58:13,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:58:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-18 15:58:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658307621] [2024-09-18 15:58:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:58:13,825 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-18 15:58:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:58:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-18 15:58:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 15:58:13,852 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-18 15:58:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:58:13,897 INFO L93 Difference]: Finished difference Result 66 states and 110 transitions. [2024-09-18 15:58:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-18 15:58:13,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-18 15:58:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:58:13,911 INFO L225 Difference]: With dead ends: 66 [2024-09-18 15:58:13,911 INFO L226 Difference]: Without dead ends: 32 [2024-09-18 15:58:13,914 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-18 15:58:13,917 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-18 15:58:13,918 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-18 15:58:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-18 15:58:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-18 15:58:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-18 15:58:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2024-09-18 15:58:13,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 22 [2024-09-18 15:58:13,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:58:13,968 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2024-09-18 15:58:13,968 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-18 15:58:13,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2024-09-18 15:58:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-18 15:58:13,973 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:58:13,973 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:58:13,974 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-18 15:58:13,974 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:58:13,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2095105318, now seen corresponding path program 1 times [2024-09-18 15:58:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:58:13,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869469972] [2024-09-18 15:58:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:58:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:14,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:58:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:14,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:58:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:14,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-18 15:58:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:58:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869469972] [2024-09-18 15:58:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869469972] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:58:14,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:58:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-18 15:58:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172878873] [2024-09-18 15:58:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:58:14,542 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-18 15:58:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:58:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-18 15:58:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:58:14,545 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-18 15:58:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:58:14,886 INFO L93 Difference]: Finished difference Result 64 states and 92 transitions. [2024-09-18 15:58:14,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-18 15:58:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-18 15:58:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:58:14,888 INFO L225 Difference]: With dead ends: 64 [2024-09-18 15:58:14,888 INFO L226 Difference]: Without dead ends: 46 [2024-09-18 15:58:14,889 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:58:14,890 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-18 15:58:14,890 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-18 15:58:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-18 15:58:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-09-18 15:58:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-18 15:58:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2024-09-18 15:58:14,905 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2024-09-18 15:58:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:58:14,905 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2024-09-18 15:58:14,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-18 15:58:14,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2024-09-18 15:58:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-18 15:58:14,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:58:14,909 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:58:14,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-18 15:58:14,909 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:58:14,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1429886677, now seen corresponding path program 1 times [2024-09-18 15:58:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:58:14,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187001638] [2024-09-18 15:58:14,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:58:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:15,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 15:58:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:15,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 15:58:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:15,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-18 15:58:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:58:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187001638] [2024-09-18 15:58:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187001638] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:58:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828094611] [2024-09-18 15:58:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:58:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:58:15,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:58:15,223 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-18 15:58:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:15,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-18 15:58:15,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:58:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:15,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:58:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828094611] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:58:15,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-18 15:58:15,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-18 15:58:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263891261] [2024-09-18 15:58:15,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-18 15:58:15,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-18 15:58:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:58:15,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-18 15:58:15,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-18 15:58:15,594 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-18 15:58:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:58:17,672 INFO L93 Difference]: Finished difference Result 115 states and 181 transitions. [2024-09-18 15:58:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-18 15:58:17,672 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-18 15:58:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:58:17,675 INFO L225 Difference]: With dead ends: 115 [2024-09-18 15:58:17,675 INFO L226 Difference]: Without dead ends: 97 [2024-09-18 15:58:17,676 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-18 15:58:17,677 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-09-18 15:58:17,677 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 304 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-09-18 15:58:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-18 15:58:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2024-09-18 15:58:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-18 15:58:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-09-18 15:58:17,706 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 25 [2024-09-18 15:58:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:58:17,707 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-09-18 15:58:17,707 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 13 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-18 15:58:17,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-09-18 15:58:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-18 15:58:17,710 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:58:17,710 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:58:17,726 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-18 15:58:17,914 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:58:17,915 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:58:17,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:17,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1189191834, now seen corresponding path program 1 times [2024-09-18 15:58:17,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:58:17,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37708773] [2024-09-18 15:58:17,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:17,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:58:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 15:58:17,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611868874] [2024-09-18 15:58:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:17,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:58:17,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:58:17,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:58:17,954 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-18 15:58:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:17,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-18 15:58:18,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:58:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-18 15:58:18,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 15:58:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:58:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37708773] [2024-09-18 15:58:18,051 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 15:58:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611868874] [2024-09-18 15:58:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611868874] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:58:18,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:58:18,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-18 15:58:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875639965] [2024-09-18 15:58:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:58:18,055 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-18 15:58:18,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:58:18,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-18 15:58:18,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-18 15:58:18,056 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-18 15:58:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:58:18,226 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-09-18 15:58:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-18 15:58:18,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-18 15:58:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:58:18,228 INFO L225 Difference]: With dead ends: 90 [2024-09-18 15:58:18,230 INFO L226 Difference]: Without dead ends: 87 [2024-09-18 15:58:18,231 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-18 15:58:18,232 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-18 15:58:18,232 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-18 15:58:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-18 15:58:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-18 15:58:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 39 states have call successors, (39), 8 states have call predecessors, (39), 7 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-18 15:58:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-09-18 15:58:18,254 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 33 [2024-09-18 15:58:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:58:18,254 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-09-18 15:58:18,255 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-18 15:58:18,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-09-18 15:58:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-18 15:58:18,256 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:58:18,256 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:58:18,272 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-18 15:58:18,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:58:18,461 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:58:18,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:58:18,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1682280212, now seen corresponding path program 1 times [2024-09-18 15:58:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:58:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855490006] [2024-09-18 15:58:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:58:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 15:58:18,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392491170] [2024-09-18 15:58:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:58:18,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:58:18,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:58:18,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:58:18,479 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-18 15:58:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:58:18,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-18 15:58:18,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:58:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:18,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:58:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-18 15:58:22,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:58:22,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855490006] [2024-09-18 15:58:22,146 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 15:58:22,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392491170] [2024-09-18 15:58:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392491170] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-18 15:58:22,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 15:58:22,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-18 15:58:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284486605] [2024-09-18 15:58:22,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 15:58:22,147 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-18 15:58:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:58:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-18 15:58:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-18 15:58:22,148 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-18 15:58:35,481 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 29 DAG size of output: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-18 15:58:39,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:58:40,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 15:58:45,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:58:48,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:58:53,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:58:58,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:02,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:06,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:10,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:14,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:19,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:23,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:28,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:32,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:59:32,358 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-09-18 15:59:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:59:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-09-18 15:59:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:59:32,360 INFO L225 Difference]: With dead ends: 156 [2024-09-18 15:59:32,361 INFO L226 Difference]: Without dead ends: 132 [2024-09-18 15:59:32,361 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-18 15:59:32,362 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 55 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.9s IncrementalHoareTripleChecker+Time [2024-09-18 15:59:32,362 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 297 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 56.9s Time] [2024-09-18 15:59:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-09-18 15:59:32,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-09-18 15:59:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 57 states have call successors, (57), 11 states have call predecessors, (57), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-09-18 15:59:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-09-18 15:59:32,402 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 32 [2024-09-18 15:59:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:59:32,402 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-09-18 15:59:32,403 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-18 15:59:32,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:59:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-09-18 15:59:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-18 15:59:32,405 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:59:32,405 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:59:32,413 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-18 15:59:32,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:59:32,606 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:59:32,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:59:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -7962503, now seen corresponding path program 1 times [2024-09-18 15:59:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:59:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566726902] [2024-09-18 15:59:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:59:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:59:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 15:59:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2020694113] [2024-09-18 15:59:32,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:59:32,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:59:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:59:32,634 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:59:32,637 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-18 15:59:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:59:32,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-18 15:59:32,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:59:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-18 15:59:32,856 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-18 15:59:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:59:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566726902] [2024-09-18 15:59:32,859 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 15:59:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020694113] [2024-09-18 15:59:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020694113] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-18 15:59:32,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-18 15:59:32,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-18 15:59:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060197062] [2024-09-18 15:59:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-18 15:59:32,860 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-18 15:59:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:59:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-18 15:59:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-18 15:59:32,861 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-09-18 15:59:37,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 15:59:37,156 INFO L93 Difference]: Finished difference Result 140 states and 191 transitions. [2024-09-18 15:59:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 15:59:37,156 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-09-18 15:59:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 15:59:37,159 INFO L225 Difference]: With dead ends: 140 [2024-09-18 15:59:37,159 INFO L226 Difference]: Without dead ends: 138 [2024-09-18 15:59:37,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-18 15:59:37,160 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-09-18 15:59:37,161 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 256 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-09-18 15:59:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-18 15:59:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-18 15:59:37,186 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-09-18 15:59:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2024-09-18 15:59:37,188 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 44 [2024-09-18 15:59:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 15:59:37,188 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2024-09-18 15:59:37,189 INFO L475 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-09-18 15:59:37,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:59:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2024-09-18 15:59:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-18 15:59:37,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 15:59:37,191 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 15:59:37,209 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-18 15:59:37,392 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:59:37,392 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 15:59:37,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 15:59:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash -409333978, now seen corresponding path program 1 times [2024-09-18 15:59:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 15:59:37,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334746995] [2024-09-18 15:59:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:59:37,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 15:59:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-18 15:59:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297045017] [2024-09-18 15:59:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 15:59:37,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 15:59:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 15:59:37,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 15:59:37,439 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-18 15:59:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 15:59:37,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-18 15:59:37,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 15:59:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-18 15:59:37,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 15:59:49,860 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod (+ (* 4294967295 c_main_~n~0) c_main_~r~0 (* c_main_~p~0 c_main_~p~0)) 4294967296) 0) (forall ((main_~q~0 Int)) (not (= (mod (+ (* main_~q~0 main_~q~0 4294967295 c_main_~h~0) (* 4294967292 main_~q~0 main_~q~0 c_main_~p~0) (* main_~q~0 c_main_~r~0 12 c_main_~h~0) (* main_~q~0 16 c_main_~p~0 c_main_~n~0) (* c_main_~h~0 c_main_~h~0 c_main_~h~0) (* main_~q~0 c_main_~n~0 4294967284 c_main_~h~0) (* main_~q~0 c_main_~p~0 c_main_~r~0 4294967280)) 4294967296) 0)))) is different from false [2024-09-18 15:59:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 15:59:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334746995] [2024-09-18 15:59:49,866 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-18 15:59:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297045017] [2024-09-18 15:59:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297045017] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 15:59:49,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-18 15:59:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-18 15:59:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140123670] [2024-09-18 15:59:49,866 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-18 15:59:49,867 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-18 15:59:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 15:59:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-18 15:59:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-09-18 15:59:49,868 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-09-18 15:59:54,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 15:59:58,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 16:00:02,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-18 16:00:06,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:00:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:00:06,424 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2024-09-18 16:00:06,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-18 16:00:06,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 59 [2024-09-18 16:00:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:00:06,426 INFO L225 Difference]: With dead ends: 156 [2024-09-18 16:00:06,426 INFO L226 Difference]: Without dead ends: 138 [2024-09-18 16:00:06,427 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-09-18 16:00:06,427 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-09-18 16:00:06,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 120 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2024-09-18 16:00:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-18 16:00:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-09-18 16:00:06,461 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-09-18 16:00:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-09-18 16:00:06,464 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 59 [2024-09-18 16:00:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:00:06,465 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-09-18 16:00:06,465 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-18 16:00:06,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:00:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-09-18 16:00:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-18 16:00:06,470 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:00:06,470 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-18 16:00:06,487 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-18 16:00:06,670 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-18 16:00:06,671 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:00:06,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:00:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 382001091, now seen corresponding path program 1 times [2024-09-18 16:00:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:00:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118286034] [2024-09-18 16:00:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:00:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:00:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:00:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:00:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-18 16:00:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-18 16:00:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-18 16:00:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-18 16:00:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-18 16:00:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-18 16:00:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-18 16:00:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-18 16:00:07,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:00:07,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118286034] [2024-09-18 16:00:07,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118286034] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:00:07,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541253457] [2024-09-18 16:00:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:00:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:00:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:00:07,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-18 16:00:07,617 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-18 16:00:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:00:07,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-18 16:00:07,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:00:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-18 16:00:08,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:00:25,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~q~0 4294967296))) (let ((.cse0 (div .cse1 4))) (or (< (mod c_main_~r~0 4294967296) (mod (+ c_main_~p~0 .cse0) 4294967296)) (< (mod (+ (* 4294967295 .cse0) c_main_~r~0 (* 4294967295 c_main_~p~0)) 4294967296) (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse0) c_main_~p~0) 4294967296)) (not (= (mod (+ (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0) (* c_main_~q~0 c_main_~r~0 4 c_main_~h~0) (* c_main_~p~0 c_main_~h~0 c_main_~h~0) (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4) (* 4294967292 c_main_~q~0 c_main_~p~0 c_main_~r~0) (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) 4294967296) 0)) (= .cse1 1)))) is different from false [2024-09-18 16:00:54,839 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-18 16:01:16,450 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-18 16:01:20,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (mod c_main_~q~0 4294967296))) (or (let ((.cse11 (div .cse12 4))) (let ((.cse1 (mod (+ c_main_~p~0 .cse11) 4294967296)) (.cse9 (mod (+ (* 4294967295 .cse11) (* 4294967295 c_main_~p~0)) 4294967296)) (.cse7 (mod (+ (* 4294967295 (mod c_main_~p~0 2)) (* 3 .cse11) c_main_~p~0) 4294967296)) (.cse2 (* c_main_~q~0 c_main_~q~0 4294967295 c_main_~p~0)) (.cse3 (* c_main_~p~0 c_main_~h~0 c_main_~h~0)) (.cse4 (* c_main_~q~0 c_main_~p~0 c_main_~n~0 4)) (.cse5 (* 4294967292 c_main_~q~0 c_main_~n~0 c_main_~h~0)) (.cse8 (mod (+ (* 2 c_main_~p~0) c_main_~q~0) 4294967296))) (and (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse6 (+ v_z_14 .cse9)) (.cse0 (* v_y_14 4294967296))) (or (< (+ v_z_14 .cse0) .cse1) (not (= (mod (+ .cse2 (* v_z_14 c_main_~q~0 4 c_main_~h~0) (* 4294967292 v_z_14 c_main_~q~0 c_main_~p~0) .cse3 .cse4 .cse5) 4294967296) 0)) (< .cse6 .cse7) (< 4294967295 .cse6) (< .cse8 (+ v_z_14 .cse0 1)) (< v_z_14 0)))) (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse10 (* v_y_14 4294967296))) (or (< (+ v_z_14 .cse10) .cse1) (< (+ v_z_14 .cse9) (+ 4294967296 .cse7)) (not (= (mod (+ .cse2 (* v_z_14 c_main_~q~0 4 c_main_~h~0) (* 4294967292 v_z_14 c_main_~q~0 c_main_~p~0) .cse3 .cse4 .cse5) 4294967296) 0)) (< 4294967295 v_z_14) (< .cse8 (+ v_z_14 .cse10 1)))))))) (= .cse12 1))) is different from false [2024-09-18 16:01:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541253457] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:01:20,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-18 16:01:20,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-18 16:01:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53067999] [2024-09-18 16:01:20,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-18 16:01:20,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-18 16:01:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-18 16:01:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-18 16:01:20,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=432, Unknown=2, NotChecked=86, Total=600 [2024-09-18 16:01:20,612 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-09-18 16:01:25,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:29,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:33,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:37,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:41,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:42,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:46,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:50,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:54,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:01:59,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:02:03,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:02:07,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:02:11,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:02:15,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-18 16:02:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-18 16:02:16,099 INFO L93 Difference]: Finished difference Result 182 states and 245 transitions. [2024-09-18 16:02:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-18 16:02:16,100 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-09-18 16:02:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-18 16:02:16,116 INFO L225 Difference]: With dead ends: 182 [2024-09-18 16:02:16,116 INFO L226 Difference]: Without dead ends: 151 [2024-09-18 16:02:16,117 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=117, Invalid=645, Unknown=2, NotChecked=106, Total=870 [2024-09-18 16:02:16,118 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 21 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.2s IncrementalHoareTripleChecker+Time [2024-09-18 16:02:16,118 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 459 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 426 Invalid, 13 Unknown, 0 Unchecked, 55.2s Time] [2024-09-18 16:02:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-09-18 16:02:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-09-18 16:02:16,145 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-09-18 16:02:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2024-09-18 16:02:16,147 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 58 [2024-09-18 16:02:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-18 16:02:16,147 INFO L474 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2024-09-18 16:02:16,147 INFO L475 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-09-18 16:02:16,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:02:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2024-09-18 16:02:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-18 16:02:16,149 INFO L208 NwaCegarLoop]: Found error trace [2024-09-18 16:02:16,149 INFO L216 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-09-18 16:02:16,166 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-18 16:02:16,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:02:16,350 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-18 16:02:16,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-18 16:02:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1682429464, now seen corresponding path program 2 times [2024-09-18 16:02:16,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-18 16:02:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932594638] [2024-09-18 16:02:16,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-18 16:02:16,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-18 16:02:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-18 16:02:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-18 16:02:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-18 16:02:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-18 16:02:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-18 16:02:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-18 16:02:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-18 16:02:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-18 16:02:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-18 16:02:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-18 16:02:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-18 16:02:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-18 16:02:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932594638] [2024-09-18 16:02:17,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932594638] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-18 16:02:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967517458] [2024-09-18 16:02:17,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-18 16:02:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-18 16:02:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-18 16:02:17,619 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-09-18 16:02:17,620 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-18 16:02:17,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-18 16:02:17,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-18 16:02:17,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-18 16:02:17,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-18 16:02:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-18 16:02:19,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-18 16:02:48,353 WARN L293 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)