./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --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 a9b967e5 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/recursive/Primes.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --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-a9b967e-m [2024-09-11 20:25:07,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:25:07,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:25:07,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:25:07,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:25:07,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:25:07,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:25:07,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:25:07,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:25:07,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:25:07,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:25:07,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:25:07,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:25:07,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:25:07,182 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:25:07,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:25:07,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:25:07,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:25:07,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:25:07,183 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:25:07,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:25:07,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:25:07,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:25:07,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:25:07,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:25:07,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:25:07,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:25:07,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:25:07,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:25:07,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:25:07,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:25:07,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:25:07,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:07,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:25:07,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:25:07,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:25:07,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:25:07,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:25:07,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:25:07,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:25:07,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:25:07,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:25:07,189 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e 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-11 20:25:07,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:25:07,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:25:07,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:25:07,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:25:07,394 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:25:07,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Primes.c [2024-09-11 20:25:08,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:25:08,798 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:25:08,799 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c [2024-09-11 20:25:08,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5d8447c89/c3d1fee4c0454a29beb2753917657e14/FLAG0737558f3 [2024-09-11 20:25:08,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5d8447c89/c3d1fee4c0454a29beb2753917657e14 [2024-09-11 20:25:08,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:25:08,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:25:08,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:08,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:25:08,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:25:08,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:08" (1/1) ... [2024-09-11 20:25:08,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75565a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:08, skipping insertion in model container [2024-09-11 20:25:08,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:08" (1/1) ... [2024-09-11 20:25:08,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:25:08,992 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/recursive/Primes.c[2190,2203] [2024-09-11 20:25:08,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:09,006 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:25:09,019 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/recursive/Primes.c[2190,2203] [2024-09-11 20:25:09,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:09,039 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:25:09,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09 WrapperNode [2024-09-11 20:25:09,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:09,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:09,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:25:09,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:25:09,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,067 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-09-11 20:25:09,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:09,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:25:09,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:25:09,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:25:09,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,086 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-11 20:25:09,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:25:09,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:25:09,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:25:09,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:25:09,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (1/1) ... [2024-09-11 20:25:09,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:09,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:09,138 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-11 20:25:09,140 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-11 20:25:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-09-11 20:25:09,189 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-09-11 20:25:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:25:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-09-11 20:25:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-09-11 20:25:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-09-11 20:25:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-09-11 20:25:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:25:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:25:09,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:25:09,261 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:25:09,262 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:25:09,417 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-09-11 20:25:09,417 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:25:09,437 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:25:09,437 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:25:09,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:09 BoogieIcfgContainer [2024-09-11 20:25:09,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:25:09,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:25:09,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:25:09,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:25:09,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:25:08" (1/3) ... [2024-09-11 20:25:09,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102d6714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:09, skipping insertion in model container [2024-09-11 20:25:09,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:09" (2/3) ... [2024-09-11 20:25:09,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102d6714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:09, skipping insertion in model container [2024-09-11 20:25:09,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:09" (3/3) ... [2024-09-11 20:25:09,444 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-09-11 20:25:09,457 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:25:09,458 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:25:09,497 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:25:09,502 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;@4696ccde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:25:09,502 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:25:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:25:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:25:09,511 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:09,511 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:09,512 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:09,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1349448312, now seen corresponding path program 1 times [2024-09-11 20:25:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370200857] [2024-09-11 20:25:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:09,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:09,673 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-11 20:25:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370200857] [2024-09-11 20:25:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370200857] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:09,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:09,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 20:25:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141759692] [2024-09-11 20:25:09,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:09,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 20:25:09,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:09,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 20:25:09,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 20:25:09,699 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:09,746 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2024-09-11 20:25:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 20:25:09,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-11 20:25:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:09,757 INFO L225 Difference]: With dead ends: 54 [2024-09-11 20:25:09,757 INFO L226 Difference]: Without dead ends: 47 [2024-09-11 20:25:09,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 20:25:09,762 INFO L434 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:09,763 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-11 20:25:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-11 20:25:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:25:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2024-09-11 20:25:09,792 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 13 [2024-09-11 20:25:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:09,793 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-09-11 20:25:09,793 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:25:09,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:09,793 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-09-11 20:25:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 20:25:09,796 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:09,796 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:09,796 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:25:09,796 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:09,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1094481281, now seen corresponding path program 1 times [2024-09-11 20:25:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951359795] [2024-09-11 20:25:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:09,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:09,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 20:25:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:09,972 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-11 20:25:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951359795] [2024-09-11 20:25:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951359795] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:09,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144483441] [2024-09-11 20:25:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:09,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:09,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:09,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:09,977 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:10,020 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2024-09-11 20:25:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:10,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-11 20:25:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:10,023 INFO L225 Difference]: With dead ends: 68 [2024-09-11 20:25:10,024 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:25:10,024 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:10,027 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:10,027 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:25:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-11 20:25:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-11 20:25:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-09-11 20:25:10,046 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 20 [2024-09-11 20:25:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:10,046 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-09-11 20:25:10,047 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:10,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-09-11 20:25:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 20:25:10,048 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:10,048 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:10,048 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:25:10,049 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:10,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash -306925128, now seen corresponding path program 1 times [2024-09-11 20:25:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:10,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907397045] [2024-09-11 20:25:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:25:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,194 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-11 20:25:10,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:10,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907397045] [2024-09-11 20:25:10,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907397045] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:10,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:10,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:10,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317059939] [2024-09-11 20:25:10,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:10,196 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:10,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:10,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:10,197 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:10,241 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-09-11 20:25:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:10,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-11 20:25:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:10,242 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:25:10,242 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 20:25:10,243 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:10,244 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:10,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 288 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 20:25:10,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-11 20:25:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-11 20:25:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-09-11 20:25:10,251 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2024-09-11 20:25:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:10,251 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-09-11 20:25:10,251 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:10,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-09-11 20:25:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 20:25:10,253 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:10,253 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:10,253 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:25:10,253 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:10,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash -224959538, now seen corresponding path program 1 times [2024-09-11 20:25:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:10,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484494315] [2024-09-11 20:25:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:25:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,325 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-11 20:25:10,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:10,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484494315] [2024-09-11 20:25:10,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484494315] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:10,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:10,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:25:10,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660571310] [2024-09-11 20:25:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:10,326 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:25:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:25:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:25:10,327 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:10,413 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2024-09-11 20:25:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:10,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-11 20:25:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:10,437 INFO L225 Difference]: With dead ends: 59 [2024-09-11 20:25:10,439 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 20:25:10,442 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-11 20:25:10,444 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:10,448 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 200 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 20:25:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-09-11 20:25:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-11 20:25:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-09-11 20:25:10,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 22 [2024-09-11 20:25:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:10,464 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-09-11 20:25:10,464 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:10,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-09-11 20:25:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 20:25:10,466 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:10,466 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, 1, 1, 1] [2024-09-11 20:25:10,466 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 20:25:10,468 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:10,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1677803704, now seen corresponding path program 1 times [2024-09-11 20:25:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:10,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615767215] [2024-09-11 20:25:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:25:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615767215] [2024-09-11 20:25:10,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615767215] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:10,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2700115] [2024-09-11 20:25:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:10,547 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-11 20:25:10,548 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-11 20:25:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:10,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 20:25:10,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:25:10,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2700115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:10,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-11 20:25:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902595647] [2024-09-11 20:25:10,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:10,769 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:25:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:25:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:25:10,770 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:25:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:10,855 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2024-09-11 20:25:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:25:10,855 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2024-09-11 20:25:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:10,856 INFO L225 Difference]: With dead ends: 68 [2024-09-11 20:25:10,856 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:25:10,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:25:10,857 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:10,858 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 303 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:25:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-11 20:25:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-11 20:25:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-09-11 20:25:10,863 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2024-09-11 20:25:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:10,863 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-09-11 20:25:10,863 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:25:10,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-09-11 20:25:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 20:25:10,864 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:10,864 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, 1, 1] [2024-09-11 20:25:10,878 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:25:11,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:11,065 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:11,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1617599152, now seen corresponding path program 1 times [2024-09-11 20:25:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089451154] [2024-09-11 20:25:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:11,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:11,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:25:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:11,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:11,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089451154] [2024-09-11 20:25:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089451154] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865281957] [2024-09-11 20:25:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:11,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:11,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:11,236 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-11 20:25:11,237 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-11 20:25:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:11,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 20:25:11,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:11,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865281957] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:11,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-09-11 20:25:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748999454] [2024-09-11 20:25:11,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:11,703 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:25:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:25:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:25:11,704 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 23 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-11 20:25:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:12,020 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-09-11 20:25:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:25:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 30 [2024-09-11 20:25:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:12,023 INFO L225 Difference]: With dead ends: 69 [2024-09-11 20:25:12,024 INFO L226 Difference]: Without dead ends: 52 [2024-09-11 20:25:12,025 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:25:12,025 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 25 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:12,026 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 729 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-11 20:25:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-09-11 20:25:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-11 20:25:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-09-11 20:25:12,040 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 30 [2024-09-11 20:25:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:12,041 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-09-11 20:25:12,041 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.25) internal successors, (45), 17 states have internal predecessors, (45), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-11 20:25:12,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-09-11 20:25:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 20:25:12,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:12,042 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, 1, 1, 1, 1] [2024-09-11 20:25:12,061 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:25:12,250 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:25:12,251 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:12,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1287840268, now seen corresponding path program 1 times [2024-09-11 20:25:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:12,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408356992] [2024-09-11 20:25:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:25:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:12,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408356992] [2024-09-11 20:25:12,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408356992] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:12,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 20:25:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72124198] [2024-09-11 20:25:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:12,410 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:25:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:25:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:12,411 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:25:12,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:12,506 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2024-09-11 20:25:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:25:12,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-09-11 20:25:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:12,508 INFO L225 Difference]: With dead ends: 70 [2024-09-11 20:25:12,508 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 20:25:12,508 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:12,508 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:12,509 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 253 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 20:25:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-11 20:25:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-11 20:25:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-09-11 20:25:12,520 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2024-09-11 20:25:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:12,522 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-09-11 20:25:12,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:25:12,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-09-11 20:25:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:25:12,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:12,526 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:12,526 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:25:12,526 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:12,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1285376925, now seen corresponding path program 1 times [2024-09-11 20:25:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884832704] [2024-09-11 20:25:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:25:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 20:25:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:25:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:12,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884832704] [2024-09-11 20:25:12,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884832704] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:12,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:12,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:25:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627304635] [2024-09-11 20:25:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:12,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:25:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:25:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:25:12,594 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:12,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:12,656 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2024-09-11 20:25:12,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2024-09-11 20:25:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:12,657 INFO L225 Difference]: With dead ends: 103 [2024-09-11 20:25:12,657 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:25:12,658 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-11 20:25:12,659 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:12,659 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 165 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:25:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-09-11 20:25:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-11 20:25:12,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-11 20:25:12,670 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 50 [2024-09-11 20:25:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:12,670 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-11 20:25:12,670 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:12,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-11 20:25:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 20:25:12,671 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:12,675 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:12,675 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 20:25:12,675 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:12,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash -68737779, now seen corresponding path program 1 times [2024-09-11 20:25:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:12,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331561807] [2024-09-11 20:25:12,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:12,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 20:25:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 20:25:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:12,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331561807] [2024-09-11 20:25:12,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331561807] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706688439] [2024-09-11 20:25:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:12,757 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-11 20:25:12,758 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-11 20:25:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:12,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 20:25:12,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:12,826 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:25:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706688439] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:25:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-11 20:25:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050996728] [2024-09-11 20:25:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:12,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:25:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:25:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:25:12,829 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:12,879 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2024-09-11 20:25:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:25:12,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2024-09-11 20:25:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:12,881 INFO L225 Difference]: With dead ends: 95 [2024-09-11 20:25:12,881 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 20:25:12,882 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:12,883 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:12,883 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 143 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 20:25:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-09-11 20:25:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-11 20:25:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-09-11 20:25:12,891 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 51 [2024-09-11 20:25:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:12,892 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-09-11 20:25:12,892 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:25:12,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-09-11 20:25:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-11 20:25:12,896 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:12,896 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:12,910 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:25:13,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-11 20:25:13,097 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:13,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1340831987, now seen corresponding path program 1 times [2024-09-11 20:25:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:13,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494653159] [2024-09-11 20:25:13,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:25:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:25:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 20:25:13,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494653159] [2024-09-11 20:25:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494653159] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119635546] [2024-09-11 20:25:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:13,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:13,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:13,319 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-11 20:25:13,321 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-11 20:25:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:13,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:25:13,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:13,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119635546] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:13,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:13,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-09-11 20:25:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305935710] [2024-09-11 20:25:13,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:13,707 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:25:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:13,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:25:13,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:25:13,708 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-11 20:25:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:13,922 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2024-09-11 20:25:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:25:13,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 60 [2024-09-11 20:25:13,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:13,924 INFO L225 Difference]: With dead ends: 89 [2024-09-11 20:25:13,924 INFO L226 Difference]: Without dead ends: 59 [2024-09-11 20:25:13,924 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:25:13,925 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:13,925 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 393 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-11 20:25:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2024-09-11 20:25:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2024-09-11 20:25:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-09-11 20:25:13,957 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 60 [2024-09-11 20:25:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:13,957 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-09-11 20:25:13,957 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-11 20:25:13,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-09-11 20:25:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-11 20:25:13,958 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:13,958 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:13,987 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:25:14,159 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:14,159 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:14,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2129490437, now seen corresponding path program 2 times [2024-09-11 20:25:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392614590] [2024-09-11 20:25:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:14,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 20:25:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:25:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392614590] [2024-09-11 20:25:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392614590] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:14,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329898084] [2024-09-11 20:25:14,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:25:14,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:14,452 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-11 20:25:14,453 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-11 20:25:14,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:25:14,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:14,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-11 20:25:14,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:14,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:25:15,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329898084] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:15,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:15,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 24 [2024-09-11 20:25:15,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446597384] [2024-09-11 20:25:15,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:15,118 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 20:25:15,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:15,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 20:25:15,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:25:15,119 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 24 states, 20 states have (on average 4.75) internal successors, (95), 24 states have internal predecessors, (95), 13 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2024-09-11 20:25:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:15,408 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2024-09-11 20:25:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:25:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.75) internal successors, (95), 24 states have internal predecessors, (95), 13 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) Word has length 69 [2024-09-11 20:25:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:15,409 INFO L225 Difference]: With dead ends: 89 [2024-09-11 20:25:15,409 INFO L226 Difference]: Without dead ends: 70 [2024-09-11 20:25:15,410 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:25:15,410 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:15,411 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 437 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-11 20:25:15,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2024-09-11 20:25:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (22), 12 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-11 20:25:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2024-09-11 20:25:15,419 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 69 [2024-09-11 20:25:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:15,419 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2024-09-11 20:25:15,419 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.75) internal successors, (95), 24 states have internal predecessors, (95), 13 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2024-09-11 20:25:15,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2024-09-11 20:25:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-09-11 20:25:15,420 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:15,420 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:15,432 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:25:15,621 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 20:25:15,621 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:15,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1734203497, now seen corresponding path program 1 times [2024-09-11 20:25:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:15,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507741471] [2024-09-11 20:25:15,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-11 20:25:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:25:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-11 20:25:15,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507741471] [2024-09-11 20:25:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507741471] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:25:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93796162] [2024-09-11 20:25:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:15,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:25:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:15,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:25:15,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:25:15,702 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:25:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:15,734 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2024-09-11 20:25:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:25:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2024-09-11 20:25:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:15,736 INFO L225 Difference]: With dead ends: 125 [2024-09-11 20:25:15,736 INFO L226 Difference]: Without dead ends: 64 [2024-09-11 20:25:15,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:15,739 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:15,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-11 20:25:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-09-11 20:25:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (20), 12 states have call predecessors, (20), 8 states have call successors, (20) [2024-09-11 20:25:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-09-11 20:25:15,747 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 76 [2024-09-11 20:25:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:15,747 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-09-11 20:25:15,747 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:25:15,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-09-11 20:25:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:25:15,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:15,748 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:15,748 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-11 20:25:15,749 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:15,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:15,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1605702583, now seen corresponding path program 2 times [2024-09-11 20:25:15,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:15,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136103118] [2024-09-11 20:25:15,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:15,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:25:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,926 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:15,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-11 20:25:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:16,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-11 20:25:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:16,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-11 20:25:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:16,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:25:16,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:16,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136103118] [2024-09-11 20:25:16,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136103118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:16,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81127731] [2024-09-11 20:25:16,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:25:16,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:16,007 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-11 20:25:16,008 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-11 20:25:16,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:25:16,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:16,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:25:16,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 20:25:16,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 20:25:17,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81127731] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:17,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:17,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 26 [2024-09-11 20:25:17,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233076883] [2024-09-11 20:25:17,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:17,550 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-11 20:25:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:17,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-11 20:25:17,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-09-11 20:25:17,551 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2024-09-11 20:25:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:17,769 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2024-09-11 20:25:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:25:17,770 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) Word has length 85 [2024-09-11 20:25:17,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:17,770 INFO L225 Difference]: With dead ends: 102 [2024-09-11 20:25:17,770 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:25:17,771 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:25:17,772 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:17,772 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 220 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:25:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:25:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:25:17,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-09-11 20:25:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:17,773 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:25:17,773 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2024-09-11 20:25:17,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:25:17,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:25:17,775 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:25:17,788 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:25:17,979 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:25:17,982 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:17,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:25:19,254 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:25:19,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:25:19 BoogieIcfgContainer [2024-09-11 20:25:19,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:25:19,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:25:19,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:25:19,269 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:25:19,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:09" (3/4) ... [2024-09-11 20:25:19,270 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:25:19,273 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2024-09-11 20:25:19,273 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2024-09-11 20:25:19,273 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2024-09-11 20:25:19,277 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-09-11 20:25:19,280 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-09-11 20:25:19,280 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:25:19,280 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:25:19,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:25:19,360 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:25:19,360 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:25:19,360 INFO L158 Benchmark]: Toolchain (without parser) took 10541.70ms. Allocated memory was 180.4MB in the beginning and 375.4MB in the end (delta: 195.0MB). Free memory was 106.5MB in the beginning and 146.9MB in the end (delta: -40.4MB). Peak memory consumption was 156.0MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,361 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:25:19,361 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.87ms. Allocated memory is still 180.4MB. Free memory was 106.1MB in the beginning and 94.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.56ms. Allocated memory is still 180.4MB. Free memory was 94.2MB in the beginning and 92.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,361 INFO L158 Benchmark]: Boogie Preprocessor took 25.92ms. Allocated memory is still 180.4MB. Free memory was 92.7MB in the beginning and 90.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,362 INFO L158 Benchmark]: RCFGBuilder took 342.93ms. Allocated memory was 180.4MB in the beginning and 260.0MB in the end (delta: 79.7MB). Free memory was 90.9MB in the beginning and 218.0MB in the end (delta: -127.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,362 INFO L158 Benchmark]: TraceAbstraction took 9829.19ms. Allocated memory was 260.0MB in the beginning and 375.4MB in the end (delta: 115.3MB). Free memory was 216.9MB in the beginning and 152.2MB in the end (delta: 64.8MB). Peak memory consumption was 210.5MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,362 INFO L158 Benchmark]: Witness Printer took 91.34ms. Allocated memory is still 375.4MB. Free memory was 152.2MB in the beginning and 146.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 20:25:19,363 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 180.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.87ms. Allocated memory is still 180.4MB. Free memory was 106.1MB in the beginning and 94.3MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.56ms. Allocated memory is still 180.4MB. Free memory was 94.2MB in the beginning and 92.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.92ms. Allocated memory is still 180.4MB. Free memory was 92.7MB in the beginning and 90.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.93ms. Allocated memory was 180.4MB in the beginning and 260.0MB in the end (delta: 79.7MB). Free memory was 90.9MB in the beginning and 218.0MB in the end (delta: -127.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9829.19ms. Allocated memory was 260.0MB in the beginning and 375.4MB in the end (delta: 115.3MB). Free memory was 216.9MB in the beginning and 152.2MB in the end (delta: 64.8MB). Peak memory consumption was 210.5MB. Max. memory is 16.1GB. * Witness Printer took 91.34ms. Allocated memory is still 375.4MB. Free memory was 152.2MB in the beginning and 146.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 290 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 3708 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3080 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1750 IncrementalHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 628 mSDtfsCounter, 1750 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 833 GetRequests, 656 SyntacticMatches, 17 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=11, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1131 ConstructedInterpolants, 0 QuantifiedInterpolants, 3118 SizeOfPredicates, 24 NumberOfNonLiveVariables, 978 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 283/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Location Invariant Derived location invariant: null - InvariantResult [Line: 76]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 31]: Procedure Contract for multiple_of Derived contract for procedure multiple_of. Ensures: (((((((long long) \old(m) * 2) < ((long long) \old(n) + 1)) || (\old(n) == \old(m))) || (\old(n) == 0)) || ((\old(n) + \old(m)) < 1)) || (\old(m) < 1)) - ProcedureContractResult [Line: 17]: Procedure Contract for mult Derived contract for procedure mult. Ensures: ((((2 < \result) || (\result == 0)) || (\old(m) < 2)) || (\old(n) < 2)) - ProcedureContractResult [Line: 57]: Procedure Contract for is_prime_ Derived contract for procedure is_prime_. Ensures: (((\result == 0) || (((long long) \old(m) + 1) != \old(n))) || (\old(n) < 3)) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:25:19,403 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE