./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 01:52:27,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:52:27,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:52:27,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:52:27,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:52:27,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:52:27,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:52:27,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:52:27,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:52:27,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:52:27,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:52:27,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:52:27,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:52:27,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:52:27,971 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:52:27,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:52:27,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:52:27,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:52:27,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:52:27,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:52:27,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:52:27,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:52:27,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:52:27,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:52:27,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:52:27,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:52:27,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:52:27,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:52:27,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:52:27,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:52:27,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:52:27,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:52:27,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:52:27,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:52:27,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:52:27,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:52:27,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:52:27,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:52:27,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:52:27,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:52:27,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:52:27,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:52:27,983 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 -> 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 01:52:28,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:52:28,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:52:28,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:52:28,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:52:28,253 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:52:28,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-13 01:52:29,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:52:29,761 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:52:29,776 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-13 01:52:29,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/102c8bb5f/13dc5311250a4e23a1dbaa044ad00d95/FLAG3aaae6d3b [2024-09-13 01:52:29,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/102c8bb5f/13dc5311250a4e23a1dbaa044ad00d95 [2024-09-13 01:52:29,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:52:29,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:52:29,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:52:29,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:52:29,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:52:29,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:52:29" (1/1) ... [2024-09-13 01:52:29,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5cb296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:29, skipping insertion in model container [2024-09-13 01:52:29,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:52:29" (1/1) ... [2024-09-13 01:52:29,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:52:30,012 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2024-09-13 01:52:30,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:52:30,038 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:52:30,047 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c[537,550] [2024-09-13 01:52:30,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:52:30,067 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:52:30,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30 WrapperNode [2024-09-13 01:52:30,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:52:30,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:52:30,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:52:30,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:52:30,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,092 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:52:30,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:52:30,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:52:30,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:52:30,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:52:30,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,112 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-13 01:52:30,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:52:30,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:52:30,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:52:30,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:52:30,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (1/1) ... [2024-09-13 01:52:30,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:52:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:30,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 01:52:30,168 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 01:52:30,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:52:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 01:52:30,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 01:52:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:52:30,210 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:52:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:52:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:52:30,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:52:30,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:52:30,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:52:30,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:52:30,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:52:30,275 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:52:30,277 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:52:30,489 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 01:52:30,490 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:52:30,518 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:52:30,518 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 01:52:30,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:52:30 BoogieIcfgContainer [2024-09-13 01:52:30,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:52:30,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:52:30,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:52:30,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:52:30,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:52:29" (1/3) ... [2024-09-13 01:52:30,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d2b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:52:30, skipping insertion in model container [2024-09-13 01:52:30,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:52:30" (2/3) ... [2024-09-13 01:52:30,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d2b0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:52:30, skipping insertion in model container [2024-09-13 01:52:30,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:52:30" (3/3) ... [2024-09-13 01:52:30,528 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2024-09-13 01:52:30,543 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:52:30,543 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:52:30,594 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:52:30,600 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;@54666248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:52:30,601 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:52:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 01:52:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:52:30,609 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:30,610 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:30,610 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:30,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:30,614 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-13 01:52:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:30,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970166688] [2024-09-13 01:52:30,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:30,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:30,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:52:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:30,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:52:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:30,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:52:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:30,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:52:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:52:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:30,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970166688] [2024-09-13 01:52:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970166688] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:52:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:52:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 01:52:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272534183] [2024-09-13 01:52:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:52:30,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 01:52:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 01:52:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:52:30,793 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:52:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:30,827 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-13 01:52:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 01:52:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-13 01:52:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:30,837 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:52:30,838 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 01:52:30,841 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:52:30,844 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:30,845 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:52:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 01:52:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 01:52:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:52:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-13 01:52:30,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-13 01:52:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:30,883 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-13 01:52:30,883 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:52:30,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-13 01:52:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:52:30,885 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:30,885 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:30,885 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:52:30,886 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:30,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-13 01:52:30,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:30,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860300799] [2024-09-13 01:52:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:52:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:52:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:52:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:52:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:52:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860300799] [2024-09-13 01:52:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860300799] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:52:31,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:52:31,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:52:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258261244] [2024-09-13 01:52:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:52:31,145 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:52:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:52:31,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:52:31,149 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:52:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:31,234 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-13 01:52:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:52:31,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-13 01:52:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:31,237 INFO L225 Difference]: With dead ends: 45 [2024-09-13 01:52:31,238 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 01:52:31,238 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:52:31,241 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:31,242 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:52:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 01:52:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-13 01:52:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:52:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-13 01:52:31,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-13 01:52:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:31,256 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-13 01:52:31,256 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:52:31,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-13 01:52:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 01:52:31,259 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:31,259 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:31,260 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 01:52:31,260 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:31,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-13 01:52:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797206800] [2024-09-13 01:52:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:52:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:52:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:52:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:52:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:52:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:52:31,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:31,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797206800] [2024-09-13 01:52:31,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797206800] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:52:31,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:52:31,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:52:31,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729584499] [2024-09-13 01:52:31,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:52:31,647 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:52:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:31,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:52:31,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:52:31,648 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:52:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:31,763 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-13 01:52:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:52:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-13 01:52:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:31,765 INFO L225 Difference]: With dead ends: 49 [2024-09-13 01:52:31,765 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 01:52:31,766 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:52:31,767 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:31,767 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:52:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 01:52:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-13 01:52:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:52:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-13 01:52:31,776 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-13 01:52:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:31,777 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-13 01:52:31,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:52:31,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-13 01:52:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 01:52:31,778 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:31,778 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:31,778 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 01:52:31,779 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:31,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-13 01:52:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113141471] [2024-09-13 01:52:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:31,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:52:31,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50028875] [2024-09-13 01:52:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:31,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:31,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:31,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:31,816 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-13 01:52:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:31,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 01:52:31,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 01:52:32,074 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:52:32,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113141471] [2024-09-13 01:52:32,075 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:52:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50028875] [2024-09-13 01:52:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50028875] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:52:32,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:52:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-13 01:52:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101111820] [2024-09-13 01:52:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:52:32,077 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 01:52:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:32,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 01:52:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-13 01:52:32,078 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 01:52:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:32,339 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-13 01:52:32,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 01:52:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-09-13 01:52:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:32,342 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:52:32,342 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 01:52:32,343 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-13 01:52:32,344 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:32,344 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:52:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 01:52:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 01:52:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 01:52:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-13 01:52:32,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-13 01:52:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:32,359 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-13 01:52:32,360 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-13 01:52:32,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-13 01:52:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 01:52:32,361 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:32,361 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:32,380 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 01:52:32,565 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:32,566 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:32,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-13 01:52:32,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:32,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686411225] [2024-09-13 01:52:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:52:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388626058] [2024-09-13 01:52:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:32,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:32,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:32,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-13 01:52:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:32,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 01:52:32,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:32,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:52:32,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:52:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 01:52:33,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686411225] [2024-09-13 01:52:33,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:52:33,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388626058] [2024-09-13 01:52:33,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388626058] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:52:33,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:52:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-13 01:52:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134835621] [2024-09-13 01:52:33,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:52:33,920 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 01:52:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:33,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 01:52:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-13 01:52:33,921 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-13 01:52:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:34,395 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-13 01:52:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 01:52:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-09-13 01:52:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:34,398 INFO L225 Difference]: With dead ends: 71 [2024-09-13 01:52:34,398 INFO L226 Difference]: Without dead ends: 63 [2024-09-13 01:52:34,399 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-13 01:52:34,399 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:34,400 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 01:52:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-13 01:52:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-13 01:52:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 01:52:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-09-13 01:52:34,416 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-09-13 01:52:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:34,417 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-09-13 01:52:34,417 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-13 01:52:34,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-09-13 01:52:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 01:52:34,419 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:34,419 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:34,436 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 01:52:34,622 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:34,623 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:34,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-13 01:52:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156772743] [2024-09-13 01:52:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:52:34,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [249810584] [2024-09-13 01:52:34,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:34,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:34,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:34,672 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:34,673 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-13 01:52:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:34,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-13 01:52:34,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 01:52:35,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:52:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-13 01:52:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:52:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156772743] [2024-09-13 01:52:35,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:52:35,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249810584] [2024-09-13 01:52:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249810584] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:52:35,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:52:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-09-13 01:52:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327879039] [2024-09-13 01:52:35,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:52:35,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-13 01:52:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:52:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-13 01:52:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-09-13 01:52:35,503 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-13 01:52:37,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:41,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:45,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:49,184 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-13 01:52:50,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:51,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:52:51,702 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-09-13 01:52:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 01:52:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) Word has length 54 [2024-09-13 01:52:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:52:51,704 INFO L225 Difference]: With dead ends: 90 [2024-09-13 01:52:51,704 INFO L226 Difference]: Without dead ends: 82 [2024-09-13 01:52:51,705 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-09-13 01:52:51,705 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:52:51,705 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 240 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 293 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2024-09-13 01:52:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-13 01:52:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-09-13 01:52:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 24 states have call successors, (24), 11 states have call predecessors, (24), 10 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 01:52:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 99 transitions. [2024-09-13 01:52:51,737 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 99 transitions. Word has length 54 [2024-09-13 01:52:51,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:52:51,737 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 99 transitions. [2024-09-13 01:52:51,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 12 states have internal predecessors, (29), 7 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 9 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-13 01:52:51,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2024-09-13 01:52:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-13 01:52:51,740 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:52:51,740 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:52:51,747 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 01:52:51,940 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 01:52:51,941 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:52:51,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:52:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-13 01:52:51,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:52:51,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241993946] [2024-09-13 01:52:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:51,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:52:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:52:52,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [341028205] [2024-09-13 01:52:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:52:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:52:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:52:52,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:52:52,020 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-13 01:52:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:52:52,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-09-13 01:52:52,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:52:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-13 01:52:53,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:53:22,216 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:53:34,819 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:53:42,594 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:53:50,709 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:54:02,776 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_main_~d~0 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse3 (div .cse2 2)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (not (= (mod (* c_main_~p~0 c_main_~B~0) 4294967296) .cse2)) (< (mod c_main_~r~0 4294967296) .cse3) (= .cse4 1) (= .cse0 (mod (+ (* 4294967295 .cse3) c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2))) 4294967296))))) is different from true [2024-09-13 01:54:35,057 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:54:59,204 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:55:23,253 WARN L293 SmtUtils]: Spent 24.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:55:39,284 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:55:59,135 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:56:02,282 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (* c_main_~p~0 c_main_~B~0) 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296)) (.cse3 (div .cse5 2)) (.cse2 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (< .cse2 .cse3) (= .cse4 1) (= .cse0 (mod (+ c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2)) (* .cse3 4294967295)) 4294967296)) (< .cse5 (+ 1 .cse2))))) is different from true [2024-09-13 01:56:20,967 WARN L293 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:56:36,992 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:56:53,067 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:57:13,417 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:57:30,516 WARN L293 SmtUtils]: Spent 13.04s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:57:46,540 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:57:50,560 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (* c_main_~p~0 c_main_~B~0) 4294967296))) (let ((.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse4 (mod c_main_~p~0 4294967296)) (.cse3 (div .cse5 2)) (.cse2 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ c_main_~r~0 .cse1) 4294967296))) (< .cse2 .cse3) (not (= .cse0 .cse2)) (= .cse4 1) (= .cse0 (mod (+ c_main_~r~0 .cse1 (* c_main_~B~0 (div .cse4 2)) (* .cse3 4294967295)) 4294967296)) (< .cse5 (+ 1 .cse2))))) is different from true [2024-09-13 01:58:18,734 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:58:25,447 WARN L293 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:58:38,386 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:58:54,415 WARN L293 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:59:14,544 WARN L293 SmtUtils]: Spent 14.64s on a formula simplification. DAG size of input: 7 DAG size of output: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:59:34,596 WARN L293 SmtUtils]: Spent 20.05s on a formula simplification. DAG size of input: 20 DAG size of output: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:59:46,892 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification. DAG size of input: 11 DAG size of output: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:59:50,900 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (* c_main_~p~0 c_main_~B~0) 4294967296))) (let ((.cse3 (* c_main_~q~0 c_main_~B~0)) (.cse2 (mod c_main_~p~0 4294967296)) (.cse1 (div .cse4 2)) (.cse0 (mod c_main_~r~0 4294967296))) (or (< .cse0 .cse1) (not (= c_main_~A~0 .cse0)) (= .cse2 1) (not (= c_main_~A~0 (mod (+ c_main_~r~0 .cse3) 4294967296))) (= c_main_~A~0 (mod (+ c_main_~r~0 .cse3 (* c_main_~B~0 (div .cse2 2)) (* .cse1 4294967295)) 4294967296)) (< .cse4 (+ 1 .cse0))))) is different from true [2024-09-13 02:00:13,379 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:00:17,385 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~p~0 c_main_~B~0))) (let ((.cse1 (* c_main_~q~0 c_main_~B~0)) (.cse0 (mod .cse2 2147483648))) (or (= (mod (+ (* 4294967295 .cse0) c_main_~A~0 (* c_main_~B~0 (mod c_main_~p~0 2147483648)) .cse1) 4294967296) c_main_~A~0) (< c_main_~A~0 (mod .cse2 4294967296)) (< (* 2 .cse0) (+ c_main_~A~0 1)) (not (= (mod (+ c_main_~A~0 .cse1) 4294967296) c_main_~A~0)) (< c_main_~A~0 .cse0)))) is different from true [2024-09-13 02:00:33,269 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:00:37,280 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~p~0 c_main_~B~0))) (let ((.cse0 (mod .cse2 2147483648)) (.cse1 (* c_main_~q~0 c_main_~B~0))) (or (= (mod (+ (* 4294967295 .cse0) c_main_~A~0 (* c_main_~B~0 (mod c_main_~p~0 2147483648)) .cse1) 4294967296) c_main_~A~0) (< c_main_~A~0 (mod .cse2 4294967296)) (< (* 2 .cse0) (+ c_main_~A~0 1)) (not (= (mod (+ c_main_~A~0 .cse1) 4294967296) c_main_~A~0))))) is different from true [2024-09-13 02:00:52,718 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 02:01:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 13 refuted. 0 times theorem prover too weak. 76 trivial. 7 not checked. [2024-09-13 02:01:13,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 02:01:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241993946] [2024-09-13 02:01:13,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 02:01:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341028205] [2024-09-13 02:01:13,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341028205] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 02:01:13,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 02:01:13,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2024-09-13 02:01:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915886597] [2024-09-13 02:01:13,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 02:01:13,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 02:01:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 02:01:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 02:01:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=452, Unknown=10, NotChecked=294, Total=870 [2024-09-13 02:01:13,911 INFO L87 Difference]: Start difference. First operand 82 states and 99 transitions. Second operand has 30 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 20 states have internal predecessors, (39), 14 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 16 states have call predecessors, (23), 12 states have call successors, (23) [2024-09-13 02:01:18,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:22,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:35,496 WARN L293 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 45 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:01:37,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:41,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:45,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:49,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:01:58,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:02,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:36,595 WARN L293 SmtUtils]: Spent 28.46s on a formula simplification. DAG size of input: 46 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:02:40,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:44,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:48,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-13 02:02:53,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:02:57,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:01,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:05,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:09,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:13,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:17,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:22,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:37,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:41,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:45,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:03:49,429 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-13 02:03:53,445 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-13 02:03:57,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:01,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:06,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:10,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:16,602 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:04:20,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:24,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:38,733 WARN L293 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:04:40,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:44,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:48,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:52,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:04:56,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:06,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:10,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:14,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:05:14,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:05:14,200 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2024-09-13 02:05:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-13 02:05:14,201 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 20 states have internal predecessors, (39), 14 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 16 states have call predecessors, (23), 12 states have call successors, (23) Word has length 74 [2024-09-13 02:05:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:05:14,202 INFO L225 Difference]: With dead ends: 138 [2024-09-13 02:05:14,202 INFO L226 Difference]: Without dead ends: 99 [2024-09-13 02:05:14,203 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 116 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 139.8s TimeCoverageRelationStatistics Valid=225, Invalid=840, Unknown=15, NotChecked=402, Total=1482 [2024-09-13 02:05:14,204 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 74 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 153.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 154.2s IncrementalHoareTripleChecker+Time [2024-09-13 02:05:14,204 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 323 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 352 Invalid, 36 Unknown, 541 Unchecked, 154.2s Time] [2024-09-13 02:05:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-13 02:05:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-09-13 02:05:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 56 states have internal predecessors, (58), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-13 02:05:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-09-13 02:05:14,236 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 74 [2024-09-13 02:05:14,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:05:14,236 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-09-13 02:05:14,236 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 20 states have internal predecessors, (39), 14 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (23), 16 states have call predecessors, (23), 12 states have call successors, (23) [2024-09-13 02:05:14,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:05:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-09-13 02:05:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 02:05:14,238 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:05:14,238 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 02:05:14,246 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 02:05:14,442 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 02:05:14,443 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:05:14,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:05:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-13 02:05:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 02:05:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222229540] [2024-09-13 02:05:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:05:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 02:05:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 02:05:14,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936476488] [2024-09-13 02:05:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:05:14,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 02:05:14,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 02:05:14,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 02:05:14,523 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-13 02:05:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:14,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-13 02:05:14,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:05:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 02:05:14,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 02:05:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 02:05:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222229540] [2024-09-13 02:05:19,218 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 02:05:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936476488] [2024-09-13 02:05:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936476488] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:05:19,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 02:05:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-13 02:05:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250287782] [2024-09-13 02:05:19,218 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 02:05:19,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 02:05:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 02:05:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 02:05:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=95, Unknown=1, NotChecked=0, Total=132 [2024-09-13 02:05:19,220 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-09-13 02:05:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:05:19,405 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2024-09-13 02:05:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 02:05:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2024-09-13 02:05:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:05:19,406 INFO L225 Difference]: With dead ends: 107 [2024-09-13 02:05:19,406 INFO L226 Difference]: Without dead ends: 79 [2024-09-13 02:05:19,407 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=40, Invalid=115, Unknown=1, NotChecked=0, Total=156 [2024-09-13 02:05:19,408 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 02:05:19,408 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 02:05:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-13 02:05:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-09-13 02:05:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.0) internal successors, (49), 49 states have internal predecessors, (49), 17 states have call successors, (17), 14 states have call predecessors, (17), 12 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 02:05:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2024-09-13 02:05:19,429 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 85 [2024-09-13 02:05:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:05:19,429 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2024-09-13 02:05:19,429 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-09-13 02:05:19,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:05:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2024-09-13 02:05:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-13 02:05:19,431 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 02:05:19,432 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 02:05:19,443 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 02:05:19,632 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-13 02:05:19,632 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 02:05:19,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:05:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-09-13 02:05:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 02:05:19,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816088556] [2024-09-13 02:05:19,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:05:19,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 02:05:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 02:05:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 02:05:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 02:05:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 02:05:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 02:05:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 02:05:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 02:05:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 02:05:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,893 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 02:05:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 02:05:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 02:05:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 02:05:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 02:05:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 02:05:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 02:05:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 02:05:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 02:05:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816088556] [2024-09-13 02:05:20,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816088556] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:05:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196332297] [2024-09-13 02:05:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 02:05:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 02:05:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 02:05:20,951 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-13 02:05:20,955 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-13 02:05:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 02:05:21,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-13 02:05:21,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 02:05:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 47 proven. 44 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-13 02:05:39,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 02:05:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196332297] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 02:05:41,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 02:05:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 24 [2024-09-13 02:05:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291443392] [2024-09-13 02:05:41,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 02:05:41,879 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-13 02:05:41,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 02:05:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-13 02:05:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=669, Unknown=1, NotChecked=0, Total=756 [2024-09-13 02:05:41,880 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 19 states have internal predecessors, (41), 10 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 14 states have call predecessors, (29), 10 states have call successors, (29) [2024-09-13 02:05:46,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-13 02:06:00,564 WARN L293 SmtUtils]: Spent 8.89s on a formula simplification. DAG size of input: 43 DAG size of output: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:06:09,719 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 38 DAG size of output: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:06:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 02:06:10,905 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-09-13 02:06:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 02:06:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 19 states have internal predecessors, (41), 10 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 14 states have call predecessors, (29), 10 states have call successors, (29) Word has length 90 [2024-09-13 02:06:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 02:06:10,906 INFO L225 Difference]: With dead ends: 79 [2024-09-13 02:06:10,906 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 02:06:10,907 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=138, Invalid=917, Unknown=1, NotChecked=0, Total=1056 [2024-09-13 02:06:10,907 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-09-13 02:06:10,908 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 454 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2024-09-13 02:06:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 02:06:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 02:06:10,908 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-13 02:06:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 02:06:10,909 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2024-09-13 02:06:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 02:06:10,909 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 02:06:10,909 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 19 states have internal predecessors, (41), 10 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (29), 14 states have call predecessors, (29), 10 states have call successors, (29) [2024-09-13 02:06:10,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 02:06:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 02:06:10,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 02:06:10,912 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 02:06:10,925 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-13 02:06:11,116 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-13 02:06:11,119 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 02:06:11,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 02:06:25,120 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 02:06:25,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 02:06:25 BoogieIcfgContainer [2024-09-13 02:06:25,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 02:06:25,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 02:06:25,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 02:06:25,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 02:06:25,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:52:30" (3/4) ... [2024-09-13 02:06:25,140 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 02:06:25,143 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 02:06:25,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 02:06:25,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 02:06:25,144 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 02:06:25,147 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-13 02:06:25,147 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-13 02:06:25,147 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 02:06:25,147 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 02:06:25,237 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 02:06:25,238 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 02:06:25,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 02:06:25,238 INFO L158 Benchmark]: Toolchain (without parser) took 835404.64ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 144.6MB in the beginning and 170.4MB in the end (delta: -25.8MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-09-13 02:06:25,239 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 174.1MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 02:06:25,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.19ms. Allocated memory is still 174.1MB. Free memory was 144.6MB in the beginning and 132.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 02:06:25,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.51ms. Allocated memory is still 174.1MB. Free memory was 132.5MB in the beginning and 131.9MB in the end (delta: 658.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 02:06:25,240 INFO L158 Benchmark]: Boogie Preprocessor took 35.16ms. Allocated memory is still 174.1MB. Free memory was 131.9MB in the beginning and 130.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 02:06:25,240 INFO L158 Benchmark]: RCFGBuilder took 390.47ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 116.5MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 02:06:25,241 INFO L158 Benchmark]: TraceAbstraction took 834616.47ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 115.8MB in the beginning and 175.6MB in the end (delta: -59.8MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2024-09-13 02:06:25,241 INFO L158 Benchmark]: Witness Printer took 100.02ms. Allocated memory is still 211.8MB. Free memory was 175.6MB in the beginning and 170.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 02:06:25,242 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.22ms. Allocated memory is still 174.1MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.19ms. Allocated memory is still 174.1MB. Free memory was 144.6MB in the beginning and 132.5MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.51ms. Allocated memory is still 174.1MB. Free memory was 132.5MB in the beginning and 131.9MB in the end (delta: 658.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.16ms. Allocated memory is still 174.1MB. Free memory was 131.9MB in the beginning and 130.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.47ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 116.5MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 834616.47ms. Allocated memory was 174.1MB in the beginning and 211.8MB in the end (delta: 37.7MB). Free memory was 115.8MB in the beginning and 175.6MB in the end (delta: -59.8MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 100.02ms. Allocated memory is still 211.8MB. Free memory was 175.6MB in the beginning and 170.4MB in the end (delta: 5.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: 17]: 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 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 820.5s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 286.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 175.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 1894 SdHoareTripleChecker+Invalid, 174.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 541 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1537 IncrementalHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 297 mSDtfsCounter, 1537 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 713 GetRequests, 563 SyntacticMatches, 17 SemanticMatches, 133 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 189.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=7, InterpolantAutomatonStates: 91, 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, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 531.3s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 719 ConstructedInterpolants, 8 QuantifiedInterpolants, 4320 SizeOfPredicates, 20 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 1162/1291 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: 46]: Loop Invariant Derived loop invariant: (((((((((((A % 4294967296) == ((B + r) % 4294967296)) && ((A % 4294967296) <= 1)) && ((A / 4294967296) == (r / 4294967296))) && (d == 1)) && ((r % 4294967296) < 1)) && (q == 1)) && (1 <= (((B % 2147483648) + r) % 4294967296))) && (p == 1)) || ((((((((B % 4294967296) == 1) && (((long long) B * 2) == d)) && (p == 2)) && ((A % 4294967296) == 1)) && ((A / 4294967296) == (r / 4294967296))) && ((r % 4294967296) == 1)) && (q == 0))) || (((((((r % 4294967296) <= 0) && (A == r)) && ((d % 4294967296) == 1)) && (q == 0)) && (B == d)) && (p == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((d % 4294967296) == 1) && ((A % 4294967296) <= 1)) && ((A / 4294967296) == (r / 4294967296))) && ((A + ((r / 4294967296) * 4294967296)) == (r + ((A / 4294967296) * 4294967296)))) && (q == 0)) && (B == d)) && (p == 1)) || ((((((((B % 4294967296) == 1) && (((long long) B * 2) == d)) && (p == 2)) && ((A / 4294967296) == (r / 4294967296))) && ((r % 4294967296) == 1)) && ((A + ((r / 4294967296) * 4294967296)) == (r + ((A / 4294967296) * 4294967296)))) && (q == 0))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: 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-13 02:06:25,457 WARN L435 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-09-13 02:06:25,518 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE