./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i -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 e46fdb43c1704e8aa9295c108b22e9521ffebb273e9060ca31abf40569948ab2 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 23:49:36,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 23:49:36,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 23:49:36,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 23:49:36,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 23:49:36,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 23:49:36,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 23:49:36,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 23:49:36,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 23:49:36,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 23:49:36,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 23:49:36,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 23:49:36,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 23:49:36,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 23:49:36,739 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 23:49:36,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 23:49:36,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 23:49:36,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 23:49:36,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 23:49:36,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 23:49:36,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 23:49:36,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 23:49:36,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 23:49:36,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 23:49:36,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 23:49:36,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 23:49:36,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 23:49:36,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 23:49:36,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 23:49:36,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 23:49:36,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 23:49:36,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 23:49:36,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:49:36,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 23:49:36,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 23:49:36,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 23:49:36,745 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 23:49:36,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 23:49:36,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 23:49:36,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 23:49:36,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 23:49:36,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 23:49:36,747 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 -> e46fdb43c1704e8aa9295c108b22e9521ffebb273e9060ca31abf40569948ab2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 23:49:37,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 23:49:37,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 23:49:37,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 23:49:37,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 23:49:37,033 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 23:49:37,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i [2024-09-12 23:49:38,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 23:49:38,538 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 23:49:38,539 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i [2024-09-12 23:49:38,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8c132f905/b4f7cfa292e94987ac6998a27706d58a/FLAGf8a9c62a3 [2024-09-12 23:49:38,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8c132f905/b4f7cfa292e94987ac6998a27706d58a [2024-09-12 23:49:38,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 23:49:38,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 23:49:38,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 23:49:38,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 23:49:38,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 23:49:38,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:49:38" (1/1) ... [2024-09-12 23:49:38,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd56f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:38, skipping insertion in model container [2024-09-12 23:49:38,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 11:49:38" (1/1) ... [2024-09-12 23:49:38,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 23:49:39,106 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i[951,964] [2024-09-12 23:49:39,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:49:39,128 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 23:49:39,140 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound5.i[951,964] [2024-09-12 23:49:39,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 23:49:39,160 INFO L204 MainTranslator]: Completed translation [2024-09-12 23:49:39,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39 WrapperNode [2024-09-12 23:49:39,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 23:49:39,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 23:49:39,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 23:49:39,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 23:49:39,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,189 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 23:49:39,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 23:49:39,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 23:49:39,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 23:49:39,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 23:49:39,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,226 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-12 23:49:39,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 23:49:39,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 23:49:39,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 23:49:39,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 23:49:39,236 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (1/1) ... [2024-09-12 23:49:39,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 23:49:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:49:39,262 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-12 23:49:39,264 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-12 23:49:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 23:49:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 23:49:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 23:49:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 23:49:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 23:49:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 23:49:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 23:49:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 23:49:39,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 23:49:39,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 23:49:39,368 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 23:49:39,370 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 23:49:39,548 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-12 23:49:39,548 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 23:49:39,595 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 23:49:39,599 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 23:49:39,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:49:39 BoogieIcfgContainer [2024-09-12 23:49:39,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 23:49:39,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 23:49:39,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 23:49:39,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 23:49:39,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 11:49:38" (1/3) ... [2024-09-12 23:49:39,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4677ebbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:49:39, skipping insertion in model container [2024-09-12 23:49:39,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 11:49:39" (2/3) ... [2024-09-12 23:49:39,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4677ebbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 11:49:39, skipping insertion in model container [2024-09-12 23:49:39,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:49:39" (3/3) ... [2024-09-12 23:49:39,614 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound5.i [2024-09-12 23:49:39,645 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 23:49:39,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 23:49:39,687 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 23:49:39,692 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;@730f027e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 23:49:39,692 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 23:49:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 23:49:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 23:49:39,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:49:39,702 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:49:39,703 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:49:39,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1996614108, now seen corresponding path program 1 times [2024-09-12 23:49:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:49:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152150942] [2024-09-12 23:49:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:49:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:39,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:49:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:49:39,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:49:39,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152150942] [2024-09-12 23:49:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152150942] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:49:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:49:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 23:49:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982661178] [2024-09-12 23:49:39,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:49:39,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 23:49:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:49:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 23:49:39,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 23:49:39,854 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 23:49:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:49:39,905 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2024-09-12 23:49:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 23:49:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 23:49:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:49:39,916 INFO L225 Difference]: With dead ends: 41 [2024-09-12 23:49:39,916 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 23:49:39,918 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 23:49:39,921 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:49:39,922 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:49:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 23:49:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-09-12 23:49:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:49:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-09-12 23:49:39,948 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2024-09-12 23:49:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:49:39,949 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-09-12 23:49:39,949 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 23:49:39,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-09-12 23:49:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 23:49:39,951 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:49:39,951 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:49:39,951 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 23:49:39,951 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:49:39,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1251497910, now seen corresponding path program 1 times [2024-09-12 23:49:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:49:39,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693125743] [2024-09-12 23:49:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:49:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:40,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:49:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:49:40,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:49:40,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693125743] [2024-09-12 23:49:40,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693125743] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:49:40,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:49:40,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 23:49:40,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999713462] [2024-09-12 23:49:40,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:49:40,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 23:49:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:49:40,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 23:49:40,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:49:40,095 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 23:49:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:49:40,155 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-09-12 23:49:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 23:49:40,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-12 23:49:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:49:40,157 INFO L225 Difference]: With dead ends: 34 [2024-09-12 23:49:40,157 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 23:49:40,158 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-12 23:49:40,159 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:49:40,160 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:49:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 23:49:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-12 23:49:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:49:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-09-12 23:49:40,167 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2024-09-12 23:49:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:49:40,168 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-09-12 23:49:40,168 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 23:49:40,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-09-12 23:49:40,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 23:49:40,170 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:49:40,170 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:49:40,170 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 23:49:40,170 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:49:40,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -239317110, now seen corresponding path program 1 times [2024-09-12 23:49:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:49:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268246309] [2024-09-12 23:49:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:49:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:49:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447636007] [2024-09-12 23:49:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:40,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:49:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:49:40,203 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-12 23:49:40,204 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-12 23:49:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:40,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 23:49:40,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:49:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:49:40,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 23:49:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:49:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268246309] [2024-09-12 23:49:40,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:49:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447636007] [2024-09-12 23:49:40,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447636007] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:49:40,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:49:40,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 23:49:40,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400620397] [2024-09-12 23:49:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:49:40,385 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 23:49:40,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:49:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 23:49:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:49:40,387 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 23:49:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:49:40,437 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-12 23:49:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 23:49:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 23:49:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:49:40,439 INFO L225 Difference]: With dead ends: 34 [2024-09-12 23:49:40,439 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 23:49:40,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 23:49:40,440 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:49:40,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:49:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 23:49:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-12 23:49:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:49:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-09-12 23:49:40,449 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 14 [2024-09-12 23:49:40,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:49:40,450 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-09-12 23:49:40,450 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 23:49:40,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-09-12 23:49:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 23:49:40,451 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:49:40,451 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:49:40,468 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 23:49:40,652 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-12 23:49:40,652 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:49:40,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash 726925940, now seen corresponding path program 1 times [2024-09-12 23:49:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:49:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99182456] [2024-09-12 23:49:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:49:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:40,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:49:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:40,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 23:49:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:49:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:49:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99182456] [2024-09-12 23:49:41,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99182456] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 23:49:41,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 23:49:41,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 23:49:41,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251186188] [2024-09-12 23:49:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 23:49:41,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 23:49:41,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:49:41,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 23:49:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 23:49:41,011 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:49:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:49:41,063 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2024-09-12 23:49:41,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 23:49:41,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-09-12 23:49:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:49:41,068 INFO L225 Difference]: With dead ends: 57 [2024-09-12 23:49:41,068 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 23:49:41,069 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 23:49:41,070 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 23:49:41,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 23:49:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 23:49:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 23:49:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:49:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-09-12 23:49:41,085 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2024-09-12 23:49:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:49:41,086 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-09-12 23:49:41,086 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:49:41,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-09-12 23:49:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 23:49:41,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:49:41,090 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:49:41,090 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 23:49:41,090 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:49:41,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1153424271, now seen corresponding path program 1 times [2024-09-12 23:49:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:49:41,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722254601] [2024-09-12 23:49:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:41,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:49:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:41,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:49:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:41,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-12 23:49:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 23:49:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:49:41,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722254601] [2024-09-12 23:49:41,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722254601] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:49:41,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155970479] [2024-09-12 23:49:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:41,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:49:41,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:49:41,226 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-12 23:49:41,229 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-12 23:49:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:41,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 23:49:41,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:49:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 23:49:41,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:49:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 23:49:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155970479] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:49:41,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:49:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-09-12 23:49:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746437294] [2024-09-12 23:49:41,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:49:41,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 23:49:41,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:49:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 23:49:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-09-12 23:49:41,389 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 23:49:41,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:49:41,510 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-09-12 23:49:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 23:49:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-09-12 23:49:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:49:41,512 INFO L225 Difference]: With dead ends: 72 [2024-09-12 23:49:41,514 INFO L226 Difference]: Without dead ends: 51 [2024-09-12 23:49:41,514 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-09-12 23:49:41,515 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:49:41,515 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 23:49:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-12 23:49:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-09-12 23:49:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:49:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-12 23:49:41,531 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 25 [2024-09-12 23:49:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:49:41,532 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-12 23:49:41,532 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 23:49:41,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:41,533 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-12 23:49:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 23:49:41,534 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:49:41,534 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:49:41,550 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 23:49:41,735 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:49:41,735 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:49:41,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:49:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1935504499, now seen corresponding path program 1 times [2024-09-12 23:49:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:49:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118444032] [2024-09-12 23:49:41,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:41,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:49:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:49:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353117906] [2024-09-12 23:49:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:49:41,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:49:41,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:49:41,760 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-12 23:49:41,763 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-12 23:49:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:49:41,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-12 23:49:41,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:49:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:49:42,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:49:54,317 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:50:14,359 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:50:18,375 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (mod c_main_~b~0 2147483648))) (or (= .cse0 (mod (+ c_main_~r~0 (* c_main_~q~0 2 .cse1)) 4294967296)) (not (= .cse0 (mod (+ (* c_main_~b~0 c_main_~q~0 2) c_main_~r~0) 4294967296))) (< (* 2 .cse1) (+ 1 (mod c_main_~r~0 4294967296))))) is different from true [2024-09-12 23:50:42,434 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:50:50,465 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:51:10,533 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 23:51:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-09-12 23:51:10,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:51:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118444032] [2024-09-12 23:51:10,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:51:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353117906] [2024-09-12 23:51:10,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353117906] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:51:10,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:51:10,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-09-12 23:51:10,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740582245] [2024-09-12 23:51:10,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:51:10,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 23:51:10,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:51:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 23:51:10,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=186, Unknown=1, NotChecked=28, Total=272 [2024-09-12 23:51:10,548 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:51:14,774 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-12 23:51:18,847 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-12 23:51:23,112 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-12 23:51:27,127 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-12 23:51:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:51:28,698 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-09-12 23:51:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 23:51:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-09-12 23:51:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:51:28,702 INFO L225 Difference]: With dead ends: 85 [2024-09-12 23:51:28,702 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 23:51:28,702 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=74, Invalid=235, Unknown=1, NotChecked=32, Total=342 [2024-09-12 23:51:28,707 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2024-09-12 23:51:28,707 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 239 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 4 Unknown, 81 Unchecked, 17.9s Time] [2024-09-12 23:51:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 23:51:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-09-12 23:51:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 64 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 23:51:28,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2024-09-12 23:51:28,755 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 26 [2024-09-12 23:51:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:51:28,756 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2024-09-12 23:51:28,756 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:51:28,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:51:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2024-09-12 23:51:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 23:51:28,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:51:28,759 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:51:28,770 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 23:51:28,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 23:51:28,960 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:51:28,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:51:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1306939949, now seen corresponding path program 2 times [2024-09-12 23:51:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:51:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805105590] [2024-09-12 23:51:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:51:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:51:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:29,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:51:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:29,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-12 23:51:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:29,172 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:51:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:51:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805105590] [2024-09-12 23:51:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805105590] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:51:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433482956] [2024-09-12 23:51:29,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:51:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:51:29,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:51:29,175 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-12 23:51:29,176 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-12 23:51:29,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:51:29,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:51:29,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 23:51:29,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:51:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:51:29,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:51:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:51:29,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433482956] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:51:29,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:51:29,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 12 [2024-09-12 23:51:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674195660] [2024-09-12 23:51:29,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:51:29,461 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 23:51:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:51:29,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 23:51:29,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-09-12 23:51:29,462 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 23:51:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:51:29,682 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2024-09-12 23:51:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 23:51:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-09-12 23:51:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:51:29,686 INFO L225 Difference]: With dead ends: 137 [2024-09-12 23:51:29,686 INFO L226 Difference]: Without dead ends: 89 [2024-09-12 23:51:29,686 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-09-12 23:51:29,687 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 52 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 23:51:29,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 164 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 23:51:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-12 23:51:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-09-12 23:51:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 23:51:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-09-12 23:51:29,718 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 32 [2024-09-12 23:51:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:51:29,718 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-09-12 23:51:29,718 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 23:51:29,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:51:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-09-12 23:51:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 23:51:29,721 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:51:29,721 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:51:29,728 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 23:51:29,921 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:51:29,921 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:51:29,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:51:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1305152489, now seen corresponding path program 1 times [2024-09-12 23:51:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:51:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373715871] [2024-09-12 23:51:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:51:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:51:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:51:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256234120] [2024-09-12 23:51:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:51:29,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:51:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:51:29,948 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-12 23:51:29,956 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-12 23:51:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:30,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 23:51:30,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:51:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-12 23:51:30,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:51:43,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:51:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373715871] [2024-09-12 23:51:43,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:51:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256234120] [2024-09-12 23:51:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256234120] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:51:43,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 23:51:43,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-12 23:51:43,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171319645] [2024-09-12 23:51:43,010 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 23:51:43,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 23:51:43,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:51:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 23:51:43,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=122, Unknown=3, NotChecked=0, Total=156 [2024-09-12 23:51:43,013 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:51:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:51:43,123 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-09-12 23:51:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 23:51:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-09-12 23:51:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:51:43,126 INFO L225 Difference]: With dead ends: 92 [2024-09-12 23:51:43,126 INFO L226 Difference]: Without dead ends: 71 [2024-09-12 23:51:43,126 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=38, Invalid=141, Unknown=3, NotChecked=0, Total=182 [2024-09-12 23:51:43,127 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:51:43,127 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 23:51:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-12 23:51:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-09-12 23:51:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 52 states have internal predecessors, (56), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 23:51:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-09-12 23:51:43,148 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 32 [2024-09-12 23:51:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:51:43,148 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-09-12 23:51:43,148 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 23:51:43,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:51:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-09-12 23:51:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 23:51:43,153 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:51:43,153 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:51:43,163 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 23:51:43,353 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 23:51:43,354 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:51:43,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:51:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2037540399, now seen corresponding path program 3 times [2024-09-12 23:51:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:51:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217850373] [2024-09-12 23:51:43,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:51:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:51:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:43,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 23:51:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:43,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-12 23:51:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:43,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 23:51:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:51:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:51:43,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:51:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217850373] [2024-09-12 23:51:43,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217850373] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 23:51:43,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648707470] [2024-09-12 23:51:43,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 23:51:43,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:51:43,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:51:43,880 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-12 23:51:43,881 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-12 23:53:25,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 23:53:25,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:53:25,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 23:53:25,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:53:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:53:26,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:53:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:53:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648707470] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:53:26,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 23:53:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-09-12 23:53:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148662834] [2024-09-12 23:53:26,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 23:53:26,468 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 23:53:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:53:26,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 23:53:26,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-09-12 23:53:26,469 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 23:53:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:53:26,737 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2024-09-12 23:53:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 23:53:26,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 35 [2024-09-12 23:53:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:53:26,738 INFO L225 Difference]: With dead ends: 95 [2024-09-12 23:53:26,738 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 23:53:26,739 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-09-12 23:53:26,740 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 23:53:26,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 102 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 23:53:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 23:53:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-12 23:53:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 23:53:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-09-12 23:53:26,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2024-09-12 23:53:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:53:26,760 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-09-12 23:53:26,760 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-12 23:53:26,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:53:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-09-12 23:53:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 23:53:26,762 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:53:26,762 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 23:53:26,783 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 23:53:26,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:53:26,964 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:53:26,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:53:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash -871956698, now seen corresponding path program 2 times [2024-09-12 23:53:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 23:53:26,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454820981] [2024-09-12 23:53:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:53:26,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 23:53:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 23:53:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366807998] [2024-09-12 23:53:27,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:53:27,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:53:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 23:53:27,018 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-12 23:53:27,040 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-12 23:53:27,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:53:27,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:53:27,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-12 23:53:27,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:53:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:53:27,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:53:53,304 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:54:23,486 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:54:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:54:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 23:54:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454820981] [2024-09-12 23:54:43,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 23:54:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366807998] [2024-09-12 23:54:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366807998] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:54:43,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:54:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-09-12 23:54:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541276825] [2024-09-12 23:54:43,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:54:43,656 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 23:54:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 23:54:43,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 23:54:43,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=437, Unknown=1, NotChecked=0, Total=552 [2024-09-12 23:54:43,657 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 23:54:45,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:50,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 23:54:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:54:51,081 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2024-09-12 23:54:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 23:54:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 38 [2024-09-12 23:54:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:54:51,082 INFO L225 Difference]: With dead ends: 42 [2024-09-12 23:54:51,082 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 23:54:51,083 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=144, Invalid=557, Unknown=1, NotChecked=0, Total=702 [2024-09-12 23:54:51,084 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:54:51,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2024-09-12 23:54:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 23:54:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 23:54:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 23:54:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 23:54:51,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2024-09-12 23:54:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:54:51,085 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 23:54:51,085 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 21 states have internal predecessors, (51), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 23:54:51,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:54:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 23:54:51,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 23:54:51,089 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 23:54:51,104 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 23:54:51,290 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 23:54:51,293 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2024-09-12 23:54:51,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 23:54:56,249 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 23:54:56,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 11:54:56 BoogieIcfgContainer [2024-09-12 23:54:56,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 23:54:56,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 23:54:56,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 23:54:56,275 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 23:54:56,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 11:49:39" (3/4) ... [2024-09-12 23:54:56,277 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 23:54:56,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 23:54:56,282 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 23:54:56,283 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 23:54:56,286 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-12 23:54:56,288 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-12 23:54:56,288 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 23:54:56,288 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 23:54:56,315 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((b == 1) && (A == r)) && (counter == 0)) && (q == 0)) && (B == 1)) || ((((((b == 2) && (A == r)) && (1 <= (r % 4294967296))) && (q == 0)) && (B == 1)) && (counter == 1))) || (((A == r) && (q == 0)) && (3 <= counter))) || (((((2 <= counter) && (b == 4)) && (A == r)) && (q == 0)) && (B == 1))) && (\old(counter) == 0)) [2024-09-12 23:54:56,315 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((A % 4294967296) <= 3) && (b == 2)) && (2 <= (A % 4294967296))) && (A == ((long long) r + 2))) && (B == 1)) && (4 <= counter)) && (q == 1)) || (((A == r) && (B == b)) && (q == 0))) || (((A == r) && (q == 0)) && (4 <= counter))) || ((((((2 <= counter) && (b == 2)) && (A == r)) && ((r % 4294967296) == 1)) && (q == 0)) && (B == 1))) || ((((((b == 1) && (A == ((long long) r + 1))) && ((A % 4294967296) <= 1)) && (B == 1)) && (q == 1)) && (3 <= counter))) || ((((((b == 4) && (A == r)) && ((r % 4294967296) <= 3)) && (q == 0)) && (B == 1)) && (3 <= counter))) || (((A % 4294967296) == ((r + ((unsigned long long) b * q)) % 4294967296)) && (5 <= counter))) && (\old(counter) == 0)) [2024-09-12 23:54:56,381 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 23:54:56,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 23:54:56,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 23:54:56,384 INFO L158 Benchmark]: Toolchain (without parser) took 317442.01ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 134.2MB in the beginning and 102.8MB in the end (delta: 31.4MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,385 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 23:54:56,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.38ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 122.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.92ms. Allocated memory is still 165.7MB. Free memory was 122.5MB in the beginning and 120.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,385 INFO L158 Benchmark]: Boogie Preprocessor took 45.13ms. Allocated memory is still 165.7MB. Free memory was 120.9MB in the beginning and 119.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,386 INFO L158 Benchmark]: RCFGBuilder took 364.22ms. Allocated memory is still 165.7MB. Free memory was 119.7MB in the beginning and 138.5MB in the end (delta: -18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,386 INFO L158 Benchmark]: TraceAbstraction took 316672.41ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 137.9MB in the beginning and 107.0MB in the end (delta: 30.9MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,386 INFO L158 Benchmark]: Witness Printer took 109.45ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 102.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 23:54:56,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.38ms. Allocated memory is still 165.7MB. Free memory was 134.2MB in the beginning and 122.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.92ms. Allocated memory is still 165.7MB. Free memory was 122.5MB in the beginning and 120.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.13ms. Allocated memory is still 165.7MB. Free memory was 120.9MB in the beginning and 119.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 364.22ms. Allocated memory is still 165.7MB. Free memory was 119.7MB in the beginning and 138.5MB in the end (delta: -18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 316672.41ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 137.9MB in the beginning and 107.0MB in the end (delta: 30.9MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. * Witness Printer took 109.45ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 102.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 311.6s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 1119 SdHoareTripleChecker+Invalid, 25.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 81 IncrementalHoareTripleChecker+Unchecked, 916 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 884 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 203 mSDtfsCounter, 884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 320 SyntacticMatches, 10 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 50.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=7, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 29 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 102.6s SatisfiabilityAnalysisTime, 180.3s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 3727 SizeOfPredicates, 15 NumberOfNonLiveVariables, 685 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 164/251 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((((((b == 1) && (A == r)) && (counter == 0)) && (q == 0)) && (B == 1)) || ((((((b == 2) && (A == r)) && (1 <= (r % 4294967296))) && (q == 0)) && (B == 1)) && (counter == 1))) || (((A == r) && (q == 0)) && (3 <= counter))) || (((((2 <= counter) && (b == 4)) && (A == r)) && (q == 0)) && (B == 1))) && (\old(counter) == 0)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((((((((A % 4294967296) <= 3) && (b == 2)) && (2 <= (A % 4294967296))) && (A == ((long long) r + 2))) && (B == 1)) && (4 <= counter)) && (q == 1)) || (((A == r) && (B == b)) && (q == 0))) || (((A == r) && (q == 0)) && (4 <= counter))) || ((((((2 <= counter) && (b == 2)) && (A == r)) && ((r % 4294967296) == 1)) && (q == 0)) && (B == 1))) || ((((((b == 1) && (A == ((long long) r + 1))) && ((A % 4294967296) <= 1)) && (B == 1)) && (q == 1)) && (3 <= counter))) || ((((((b == 4) && (A == r)) && ((r % 4294967296) <= 3)) && (q == 0)) && (B == 1)) && (3 <= counter))) || (((A % 4294967296) == ((r + ((unsigned long long) b * q)) % 4294967296)) && (5 <= counter))) && (\old(counter) == 0)) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main. Requires: (counter == 0) Ensures: (\old(counter) == 0) - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 23:54:56,528 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE