./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound20.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound20.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c533ab673c7ac44f09cf312108422da4b4eb94a047fb46aaa19b12fad5dce8e7 --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 00:03:02,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 00:03:02,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 00:03:02,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 00:03:02,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 00:03:02,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 00:03:02,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 00:03:02,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 00:03:02,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 00:03:02,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 00:03:02,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 00:03:02,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 00:03:02,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 00:03:02,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 00:03:02,912 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 00:03:02,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 00:03:02,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 00:03:02,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 00:03:02,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 00:03:02,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 00:03:02,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 00:03:02,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 00:03:02,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 00:03:02,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 00:03:02,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 00:03:02,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 00:03:02,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 00:03:02,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 00:03:02,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 00:03:02,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 00:03:02,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 00:03:02,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 00:03:02,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:03:02,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 00:03:02,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 00:03:02,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 00:03:02,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 00:03:02,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 00:03:02,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 00:03:02,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 00:03:02,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 00:03:02,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 00:03:02,922 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 -> c533ab673c7ac44f09cf312108422da4b4eb94a047fb46aaa19b12fad5dce8e7 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 00:03:03,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 00:03:03,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 00:03:03,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 00:03:03,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 00:03:03,211 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 00:03:03,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound20.i [2024-09-13 00:03:04,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 00:03:04,721 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 00:03:04,721 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound20.i [2024-09-13 00:03:04,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d52cb79ef/34e9ca6ab68e41729f1974c0920532e4/FLAGc94d0c632 [2024-09-13 00:03:04,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d52cb79ef/34e9ca6ab68e41729f1974c0920532e4 [2024-09-13 00:03:04,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 00:03:04,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 00:03:04,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 00:03:04,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 00:03:04,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 00:03:04,754 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:04,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa03857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04, skipping insertion in model container [2024-09-13 00:03:04,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:04,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 00:03:04,924 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound20.i[951,964] [2024-09-13 00:03:04,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:03:04,945 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 00:03:04,954 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound20.i[951,964] [2024-09-13 00:03:04,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 00:03:04,975 INFO L204 MainTranslator]: Completed translation [2024-09-13 00:03:04,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04 WrapperNode [2024-09-13 00:03:04,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 00:03:04,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 00:03:04,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 00:03:04,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 00:03:04,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:04,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:04,996 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 00:03:04,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 00:03:04,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 00:03:04,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 00:03:04,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 00:03:05,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,023 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 00:03:05,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 00:03:05,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 00:03:05,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 00:03:05,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 00:03:05,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (1/1) ... [2024-09-13 00:03:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 00:03:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:05,075 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 00:03:05,081 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 00:03:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 00:03:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 00:03:05,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 00:03:05,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 00:03:05,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 00:03:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 00:03:05,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 00:03:05,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 00:03:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 00:03:05,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 00:03:05,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 00:03:05,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 00:03:05,188 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 00:03:05,189 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 00:03:05,387 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 00:03:05,387 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 00:03:05,403 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 00:03:05,403 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 00:03:05,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:03:05 BoogieIcfgContainer [2024-09-13 00:03:05,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 00:03:05,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 00:03:05,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 00:03:05,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 00:03:05,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 12:03:04" (1/3) ... [2024-09-13 00:03:05,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a8cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:03:05, skipping insertion in model container [2024-09-13 00:03:05,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 12:03:04" (2/3) ... [2024-09-13 00:03:05,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7a8cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 12:03:05, skipping insertion in model container [2024-09-13 00:03:05,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 12:03:05" (3/3) ... [2024-09-13 00:03:05,411 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound20.i [2024-09-13 00:03:05,425 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 00:03:05,425 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 00:03:05,470 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 00:03:05,477 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;@47f4d463, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 00:03:05,478 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 00:03:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 00:03:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 00:03:05,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:05,487 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:05,487 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:05,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1191872707, now seen corresponding path program 1 times [2024-09-13 00:03:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:05,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042363132] [2024-09-13 00:03:05,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:05,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:05,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:03:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:05,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:03:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042363132] [2024-09-13 00:03:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042363132] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:03:05,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:03:05,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 00:03:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027051589] [2024-09-13 00:03:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:03:05,641 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 00:03:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:05,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 00:03:05,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 00:03:05,663 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:05,684 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2024-09-13 00:03:05,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 00:03:05,686 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-13 00:03:05,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:05,692 INFO L225 Difference]: With dead ends: 48 [2024-09-13 00:03:05,692 INFO L226 Difference]: Without dead ends: 24 [2024-09-13 00:03:05,695 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 00:03:05,697 INFO L434 NwaCegarLoop]: 29 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, 29 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 00:03:05,698 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:03:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-13 00:03:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-13 00:03:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 00:03:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-13 00:03:05,723 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2024-09-13 00:03:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:05,724 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-13 00:03:05,724 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, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:05,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-13 00:03:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 00:03:05,726 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:05,726 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:05,726 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 00:03:05,726 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:05,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 419909300, now seen corresponding path program 1 times [2024-09-13 00:03:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279094850] [2024-09-13 00:03:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:03:05,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806068125] [2024-09-13 00:03:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:05,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:05,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:05,779 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 00:03:05,781 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 00:03:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:05,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 00:03:05,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:05,941 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 00:03:05,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279094850] [2024-09-13 00:03:05,942 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:03:05,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806068125] [2024-09-13 00:03:05,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806068125] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:03:05,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:03:05,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 00:03:05,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824416863] [2024-09-13 00:03:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:03:05,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 00:03:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 00:03:05,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 00:03:05,948 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:06,017 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-13 00:03:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 00:03:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-13 00:03:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:06,020 INFO L225 Difference]: With dead ends: 35 [2024-09-13 00:03:06,021 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 00:03:06,022 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 00:03:06,023 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:06,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:03:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 00:03:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 00:03:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:03:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-13 00:03:06,043 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2024-09-13 00:03:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:06,043 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-13 00:03:06,045 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 00:03:06,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-13 00:03:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-13 00:03:06,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:06,046 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:06,059 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 00:03:06,247 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:06,247 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:06,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash -53840867, now seen corresponding path program 1 times [2024-09-13 00:03:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:06,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760333923] [2024-09-13 00:03:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:06,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:03:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:06,649 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:03:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:06,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-13 00:03:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:06,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760333923] [2024-09-13 00:03:06,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760333923] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 00:03:06,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 00:03:06,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 00:03:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68243397] [2024-09-13 00:03:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 00:03:06,672 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 00:03:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 00:03:06,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 00:03:06,673 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:06,703 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-09-13 00:03:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 00:03:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-13 00:03:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:06,705 INFO L225 Difference]: With dead ends: 56 [2024-09-13 00:03:06,705 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 00:03:06,706 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 00:03:06,707 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:06,707 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 00:03:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 00:03:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-13 00:03:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 00:03:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-13 00:03:06,715 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2024-09-13 00:03:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:06,716 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-13 00:03:06,716 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:06,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-13 00:03:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 00:03:06,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:06,717 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:06,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 00:03:06,718 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:06,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash -792506632, now seen corresponding path program 1 times [2024-09-13 00:03:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618983723] [2024-09-13 00:03:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:03:06,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1921794234] [2024-09-13 00:03:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:06,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:06,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:06,782 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 00:03:06,784 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 00:03:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:03:06,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-13 00:03:06,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:07,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:03:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:03:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618983723] [2024-09-13 00:03:15,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:03:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921794234] [2024-09-13 00:03:15,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921794234] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:03:15,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:03:15,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-13 00:03:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076729700] [2024-09-13 00:03:15,382 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:03:15,385 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 00:03:15,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:03:15,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 00:03:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=79, Unknown=2, NotChecked=0, Total=110 [2024-09-13 00:03:15,387 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:03:15,569 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-09-13 00:03:15,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 00:03:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-09-13 00:03:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:03:15,571 INFO L225 Difference]: With dead ends: 61 [2024-09-13 00:03:15,572 INFO L226 Difference]: Without dead ends: 58 [2024-09-13 00:03:15,573 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=2, NotChecked=0, Total=182 [2024-09-13 00:03:15,574 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 00:03:15,575 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 139 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 00:03:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-13 00:03:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-09-13 00:03:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 00:03:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-09-13 00:03:15,593 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2024-09-13 00:03:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:03:15,594 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-09-13 00:03:15,595 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:03:15,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-09-13 00:03:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 00:03:15,597 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:03:15,597 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:03:15,604 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 00:03:15,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:15,799 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:03:15,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:03:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1980702957, now seen corresponding path program 2 times [2024-09-13 00:03:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:03:15,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113148381] [2024-09-13 00:03:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:03:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:03:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:03:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2050640205] [2024-09-13 00:03:15,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 00:03:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:03:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:03:15,851 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 00:03:15,853 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 00:03:15,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 00:03:15,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:03:15,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-13 00:03:15,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:03:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 00:03:16,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:03:47,900 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:04:11,979 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 00:04:28,026 WARN L293 SmtUtils]: Spent 16.05s 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 00:04:32,055 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 2147483648))) (let ((.cse2 (mod c_main_~A~0 4294967296)) (.cse0 (mod c_main_~r~0 4294967296)) (.cse3 (* 2 .cse1))) (or (< .cse0 .cse1) (= .cse2 (mod (+ c_main_~r~0 (* c_main_~q~0 2 .cse1)) 4294967296)) (not (= .cse2 (mod (+ (* c_main_~b~0 c_main_~q~0 2) c_main_~r~0) 4294967296))) (< .cse3 (+ 1 .cse0)) (= (mod c_main_~B~0 4294967296) .cse3)))) is different from true [2024-09-13 00:04:48,115 WARN L293 SmtUtils]: Spent 16.05s 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 00:05:12,320 WARN L293 SmtUtils]: Spent 16.06s 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 00:05:28,352 WARN L293 SmtUtils]: Spent 16.03s 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 00:05:44,772 WARN L293 SmtUtils]: Spent 16.41s 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 00:06:01,697 WARN L293 SmtUtils]: Spent 16.92s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:06:13,764 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:06:30,259 WARN L293 SmtUtils]: Spent 16.49s 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 00:06:46,308 WARN L293 SmtUtils]: Spent 16.05s 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 00:06:50,318 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~b~0 1073741824))) (let ((.cse0 (* .cse3 4)) (.cse2 (mod c_main_~A~0 4294967296)) (.cse1 (mod c_main_~r~0 4294967296))) (or (< .cse0 (+ 1 .cse1)) (= .cse0 (mod c_main_~B~0 4294967296)) (< .cse1 (mod c_main_~b~0 4294967296)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse2)) (= .cse2 (mod (+ (* .cse3 c_main_~q~0 4) c_main_~r~0) 4294967296)) (< .cse1 (* .cse3 2))))) is different from true [2024-09-13 00:07:06,371 WARN L293 SmtUtils]: Spent 16.04s 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 00:07:22,423 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:07:46,539 WARN L293 SmtUtils]: Spent 16.03s 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 00:08:02,583 WARN L293 SmtUtils]: Spent 16.04s 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 00:08:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-09-13 00:08:02,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:08:02,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113148381] [2024-09-13 00:08:02,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:08:02,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050640205] [2024-09-13 00:08:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050640205] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:08:02,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:08:02,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2024-09-13 00:08:02,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259218498] [2024-09-13 00:08:02,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:08:02,613 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 00:08:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:08:02,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 00:08:02,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2024-09-13 00:08:02,615 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 00:08:09,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:13,519 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 00:08:17,538 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 00:08:21,993 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 00:08:26,002 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 00:08:32,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:08:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:34,306 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2024-09-13 00:08:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 00:08:34,308 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-09-13 00:08:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:34,312 INFO L225 Difference]: With dead ends: 128 [2024-09-13 00:08:34,312 INFO L226 Difference]: Without dead ends: 86 [2024-09-13 00:08:34,313 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=146, Invalid=510, Unknown=2, NotChecked=98, Total=756 [2024-09-13 00:08:34,314 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:34,314 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 231 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 316 Invalid, 4 Unknown, 150 Unchecked, 24.0s Time] [2024-09-13 00:08:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-13 00:08:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-09-13 00:08:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.180327868852459) internal successors, (72), 63 states have internal predecessors, (72), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 00:08:34,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2024-09-13 00:08:34,338 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 30 [2024-09-13 00:08:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:34,338 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2024-09-13 00:08:34,338 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-13 00:08:34,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2024-09-13 00:08:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-13 00:08:34,343 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:34,343 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:08:34,352 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 00:08:34,543 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:34,544 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:34,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash -144908535, now seen corresponding path program 3 times [2024-09-13 00:08:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:34,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934209266] [2024-09-13 00:08:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:08:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661429624] [2024-09-13 00:08:34,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 00:08:34,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:34,585 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 00:08:34,589 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 00:08:34,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-13 00:08:34,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:08:34,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-13 00:08:34,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:34,912 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-13 00:08:34,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:08:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:08:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934209266] [2024-09-13 00:08:46,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:08:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661429624] [2024-09-13 00:08:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661429624] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:08:46,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-13 00:08:46,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-09-13 00:08:46,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380730020] [2024-09-13 00:08:46,282 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-13 00:08:46,282 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 00:08:46,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:08:46,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 00:08:46,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=198, Unknown=1, NotChecked=0, Total=240 [2024-09-13 00:08:46,283 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:08:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:46,402 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2024-09-13 00:08:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 00:08:46,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-09-13 00:08:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:46,404 INFO L225 Difference]: With dead ends: 98 [2024-09-13 00:08:46,404 INFO L226 Difference]: Without dead ends: 96 [2024-09-13 00:08:46,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2024-09-13 00:08:46,405 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:46,405 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 99 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 00:08:46,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-13 00:08:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2024-09-13 00:08:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 68 states have internal predecessors, (76), 14 states have call successors, (14), 10 states have call predecessors, (14), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-13 00:08:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-09-13 00:08:46,427 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 34 [2024-09-13 00:08:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:46,427 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-09-13 00:08:46,427 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 00:08:46,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-09-13 00:08:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-13 00:08:46,431 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:46,431 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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 00:08:46,442 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 00:08:46,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:46,632 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:46,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:46,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1642225249, now seen corresponding path program 1 times [2024-09-13 00:08:46,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:46,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610706687] [2024-09-13 00:08:46,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:46,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 00:08:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 00:08:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 00:08:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 00:08:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 00:08:47,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:08:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610706687] [2024-09-13 00:08:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610706687] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 00:08:47,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839098460] [2024-09-13 00:08:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:47,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:47,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:47,100 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 00:08:47,101 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 00:08:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 00:08:47,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 00:08:47,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 00:08:47,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:08:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 00:08:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839098460] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:08:48,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 00:08:48,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 18 [2024-09-13 00:08:48,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195351660] [2024-09-13 00:08:48,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 00:08:48,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-13 00:08:48,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:08:48,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-13 00:08:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-09-13 00:08:48,895 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-13 00:08:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 00:08:49,092 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2024-09-13 00:08:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 00:08:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 36 [2024-09-13 00:08:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 00:08:49,094 INFO L225 Difference]: With dead ends: 112 [2024-09-13 00:08:49,094 INFO L226 Difference]: Without dead ends: 80 [2024-09-13 00:08:49,095 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-09-13 00:08:49,095 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 00:08:49,096 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 00:08:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-13 00:08:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-09-13 00:08:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-13 00:08:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2024-09-13 00:08:49,115 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 36 [2024-09-13 00:08:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 00:08:49,115 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2024-09-13 00:08:49,115 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 8 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-13 00:08:49,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2024-09-13 00:08:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-13 00:08:49,117 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 00:08:49,117 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 00:08:49,133 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-13 00:08:49,321 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 00:08:49,322 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 00:08:49,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 00:08:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 908173271, now seen corresponding path program 4 times [2024-09-13 00:08:49,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 00:08:49,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060578558] [2024-09-13 00:08:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 00:08:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 00:08:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 00:08:49,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238099088] [2024-09-13 00:08:49,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 00:08:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 00:08:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 00:08:49,366 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 00:08:49,367 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 00:08:49,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 00:08:49,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 00:08:49,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-13 00:08:49,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 00:08:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 00:08:49,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 00:09:20,615 WARN L293 SmtUtils]: Spent 16.04s 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 00:09:36,643 WARN L293 SmtUtils]: Spent 16.03s 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 00:10:00,718 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 00:10:04,733 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 1073741824))) (let ((.cse3 (mod c_main_~A~0 4294967296)) (.cse2 (mod c_main_~r~0 4294967296)) (.cse0 (* .cse1 2))) (or (= .cse0 (mod c_main_~B~0 4294967296)) (< (* .cse1 4) (+ 1 .cse2)) (not (= (mod (+ (* c_main_~b~0 c_main_~q~0 4) c_main_~r~0) 4294967296) .cse3)) (= .cse3 (mod (+ (* .cse1 c_main_~q~0 4) c_main_~r~0) 4294967296)) (< .cse2 .cse0)))) is different from true [2024-09-13 00:10:20,788 WARN L293 SmtUtils]: Spent 16.05s 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 00:10:36,837 WARN L293 SmtUtils]: Spent 16.05s 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 00:10:49,701 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:11:05,731 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 00:11:21,792 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:11:37,830 WARN L293 SmtUtils]: Spent 16.04s 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 00:11:53,859 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 00:12:17,925 WARN L293 SmtUtils]: Spent 16.03s 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 00:12:21,951 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~b~0 536870912))) (let ((.cse2 (* .cse3 4)) (.cse0 (mod c_main_~A~0 4294967296)) (.cse1 (mod c_main_~r~0 4294967296))) (or (not (= .cse0 (mod (+ (* c_main_~b~0 c_main_~q~0 8) c_main_~r~0) 4294967296))) (< .cse1 .cse2) (< .cse1 (mod c_main_~b~0 4294967296)) (= .cse2 (mod c_main_~B~0 4294967296)) (= (mod (+ c_main_~r~0 (* .cse3 c_main_~q~0 8)) 4294967296) .cse0) (< (* .cse3 8) (+ 1 .cse1))))) is different from true [2024-09-13 00:12:38,039 WARN L293 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:12:54,090 WARN L293 SmtUtils]: Spent 16.05s 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 00:13:10,126 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 00:13:22,222 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 00:13:38,250 WARN L293 SmtUtils]: Spent 16.03s 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 00:13:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2024-09-13 00:13:38,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 00:13:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060578558] [2024-09-13 00:13:38,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 00:13:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238099088] [2024-09-13 00:13:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238099088] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 00:13:38,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 00:13:38,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2024-09-13 00:13:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312986781] [2024-09-13 00:13:38,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 00:13:38,260 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-13 00:13:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 00:13:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-13 00:13:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=441, Unknown=3, NotChecked=90, Total=650 [2024-09-13 00:13:38,261 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-13 00:14:45,454 WARN L293 SmtUtils]: Spent 1.06m on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:14:50,384 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 00:14:54,399 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 00:14:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:14:59,740 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 00:15:09,579 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 00:15:13,904 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 00:15:17,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:15:53,546 WARN L293 SmtUtils]: Spent 35.62s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 00:15:55,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:15:59,195 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 00:16:00,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:16:13,776 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 00:16:29,381 WARN L293 SmtUtils]: Spent 6.80s 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 00:16:33,384 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 00:16:37,513 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 00:16: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 00:16:45,683 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 00:16:49,687 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 00:16:53,884 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 00:16:58,184 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 00:17:02,211 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 00:17:19,090 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 00:17:23,098 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 00:17:27,112 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 00:17:31,168 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 00:17:35,349 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 00:17:36,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 00:17:40,679 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 [] Killed by 15