./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:04:51,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:04:52,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:04:52,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:04:52,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:04:52,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:04:52,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:04:52,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:04:52,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:04:52,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:04:52,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:04:52,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:04:52,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:04:52,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:04:52,078 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:04:52,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:04:52,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:04:52,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:04:52,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:04:52,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:04:52,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:04:52,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:04:52,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:04:52,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:04:52,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:04:52,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:04:52,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:04:52,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:04:52,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:04:52,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:04:52,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:04:52,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:04:52,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:04:52,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:04:52,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:04:52,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:04:52,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:04:52,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:04:52,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:04:52,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:04:52,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:04:52,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:04:52,089 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.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:04:52,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:04:52,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:04:52,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:04:52,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:04:52,398 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:04:52,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Primes.c [2024-09-25 00:04:54,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:04:54,317 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:04:54,318 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c [2024-09-25 00:04:54,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f179c9dd1/28d761a7343f4d6da6b1ff9a35f59dc6/FLAGdf556fd6c [2024-09-25 00:04:54,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f179c9dd1/28d761a7343f4d6da6b1ff9a35f59dc6 [2024-09-25 00:04:54,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:04:54,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:04:54,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:04:54,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:04:54,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:04:54,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d11b6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54, skipping insertion in model container [2024-09-25 00:04:54,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:04:54,537 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2024-09-25 00:04:54,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:04:54,559 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:04:54,593 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2024-09-25 00:04:54,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:04:54,628 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:04:54,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54 WrapperNode [2024-09-25 00:04:54,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:04:54,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:04:54,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:04:54,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:04:54,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,705 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:04:54,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:04:54,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:04:54,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:04:54,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:04:54,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,744 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-25 00:04:54,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:04:54,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:04:54,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:04:54,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:04:54,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (1/1) ... [2024-09-25 00:04:54,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:04:54,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:54,821 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-25 00:04:54,829 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-25 00:04:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-09-25 00:04:54,885 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-09-25 00:04:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:04:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-09-25 00:04:54,885 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-09-25 00:04:54,886 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-09-25 00:04:54,886 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-09-25 00:04:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:04:54,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:04:54,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:04:54,888 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2024-09-25 00:04:54,888 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2024-09-25 00:04:54,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:04:54,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:04:54,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:04:54,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:04:54,964 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:04:54,966 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:04:55,159 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-25 00:04:55,163 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:04:55,203 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:04:55,203 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:04:55,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:04:55 BoogieIcfgContainer [2024-09-25 00:04:55,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:04:55,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:04:55,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:04:55,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:04:55,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:04:54" (1/3) ... [2024-09-25 00:04:55,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbd8b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:04:55, skipping insertion in model container [2024-09-25 00:04:55,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:04:54" (2/3) ... [2024-09-25 00:04:55,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dbd8b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:04:55, skipping insertion in model container [2024-09-25 00:04:55,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:04:55" (3/3) ... [2024-09-25 00:04:55,215 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-09-25 00:04:55,233 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:04:55,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:04:55,287 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:04:55,294 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;@5ca587cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:04:55,295 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:04:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 00:04:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 00:04:55,309 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:55,310 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-25 00:04:55,310 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:55,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:55,316 INFO L85 PathProgramCache]: Analyzing trace with hash 745641163, now seen corresponding path program 1 times [2024-09-25 00:04:55,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182284041] [2024-09-25 00:04:55,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,556 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-25 00:04:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182284041] [2024-09-25 00:04:55,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182284041] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:04:55,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:04:55,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:04:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544609761] [2024-09-25 00:04:55,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:55,564 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:04:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:55,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:04:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:04:55,592 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:04:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:55,631 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-09-25 00:04:55,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:04:55,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-25 00:04:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:55,644 INFO L225 Difference]: With dead ends: 66 [2024-09-25 00:04:55,645 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 00:04:55,647 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-25 00:04:55,650 INFO L434 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:55,651 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:04:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 00:04:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-25 00:04:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 00:04:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-09-25 00:04:55,693 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 21 [2024-09-25 00:04:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:55,694 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-09-25 00:04:55,694 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:04:55,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-09-25 00:04:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 00:04:55,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:55,697 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, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:55,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:04:55,698 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:55,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1491686554, now seen corresponding path program 1 times [2024-09-25 00:04:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:55,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623602001] [2024-09-25 00:04:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-25 00:04:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:55,939 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-25 00:04:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623602001] [2024-09-25 00:04:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623602001] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:04:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:04:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 00:04:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259421783] [2024-09-25 00:04:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:55,941 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 00:04:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 00:04:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:04:55,942 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:04:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:55,997 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-09-25 00:04:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:04:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-25 00:04:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:56,000 INFO L225 Difference]: With dead ends: 78 [2024-09-25 00:04:56,000 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 00:04:56,001 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:04:56,002 INFO L434 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:56,003 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:04:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 00:04:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 00:04:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-25 00:04:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-09-25 00:04:56,018 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 28 [2024-09-25 00:04:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:56,019 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-09-25 00:04:56,019 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:04:56,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-09-25 00:04:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:04:56,021 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:56,021 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:56,022 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:04:56,025 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1689656639, now seen corresponding path program 1 times [2024-09-25 00:04:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:56,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381166866] [2024-09-25 00:04:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 00:04:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,270 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-25 00:04:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381166866] [2024-09-25 00:04:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381166866] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:04:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:04:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:04:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370625130] [2024-09-25 00:04:56,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:56,272 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:04:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:04:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:04:56,275 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:04:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:56,333 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-09-25 00:04:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:04:56,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-25 00:04:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:56,335 INFO L225 Difference]: With dead ends: 63 [2024-09-25 00:04:56,336 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 00:04:56,336 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-25 00:04:56,337 INFO L434 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:56,337 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 265 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:04:56,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 00:04:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-25 00:04:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:04:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-25 00:04:56,347 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2024-09-25 00:04:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:56,347 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-25 00:04:56,347 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:04:56,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-25 00:04:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 00:04:56,349 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:56,350 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:56,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:04:56,350 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:56,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -145981177, now seen corresponding path program 1 times [2024-09-25 00:04:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:56,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275882525] [2024-09-25 00:04:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 00:04:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,456 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-25 00:04:56,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:56,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275882525] [2024-09-25 00:04:56,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275882525] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:04:56,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:04:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:04:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488567558] [2024-09-25 00:04:56,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:04:56,458 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:04:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:04:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:04:56,459 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 00:04:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:56,552 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-09-25 00:04:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:04:56,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-25 00:04:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:56,555 INFO L225 Difference]: With dead ends: 67 [2024-09-25 00:04:56,557 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 00:04:56,558 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-25 00:04:56,559 INFO L434 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:56,559 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 230 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:04:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 00:04:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-09-25 00:04:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 00:04:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-25 00:04:56,570 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-09-25 00:04:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:56,570 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-25 00:04:56,571 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 00:04:56,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-25 00:04:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 00:04:56,572 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:56,573 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:56,573 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 00:04:56,573 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:56,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1109477137, now seen corresponding path program 1 times [2024-09-25 00:04:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687935644] [2024-09-25 00:04:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 00:04:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:04:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,690 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-25 00:04:56,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:56,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687935644] [2024-09-25 00:04:56,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687935644] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:56,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428807967] [2024-09-25 00:04:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:56,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:56,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:56,697 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-25 00:04:56,701 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-25 00:04:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:56,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:04:56,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:56,839 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-25 00:04:56,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:57,018 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-25 00:04:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428807967] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:57,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:04:57,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-25 00:04:57,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746049788] [2024-09-25 00:04:57,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:57,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 00:04:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 00:04:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-25 00:04:57,021 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 00:04:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:57,196 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-09-25 00:04:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 00:04:57,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 37 [2024-09-25 00:04:57,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:57,199 INFO L225 Difference]: With dead ends: 76 [2024-09-25 00:04:57,199 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 00:04:57,200 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 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-25 00:04:57,201 INFO L434 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:57,203 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 458 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:04:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 00:04:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 00:04:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-25 00:04:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-09-25 00:04:57,218 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 37 [2024-09-25 00:04:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:57,221 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-09-25 00:04:57,222 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 00:04:57,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-09-25 00:04:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 00:04:57,223 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:57,223 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, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:57,249 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:04:57,424 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-25 00:04:57,425 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:57,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash -466412443, now seen corresponding path program 1 times [2024-09-25 00:04:57,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834495686] [2024-09-25 00:04:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 00:04:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:04:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,711 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-25 00:04:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:04:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834495686] [2024-09-25 00:04:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834495686] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:04:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997412998] [2024-09-25 00:04:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:04:57,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:04:57,715 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-25 00:04:57,717 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-25 00:04:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:57,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 00:04:57,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:04:57,906 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-25 00:04:57,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:04:58,521 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-25 00:04:58,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997412998] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:04:58,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:04:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-09-25 00:04:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994417341] [2024-09-25 00:04:58,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:04:58,522 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:04:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:04:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:04:58,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:04:58,524 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-25 00:04:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:04:59,443 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2024-09-25 00:04:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 00:04:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 38 [2024-09-25 00:04:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:04:59,449 INFO L225 Difference]: With dead ends: 79 [2024-09-25 00:04:59,449 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 00:04:59,450 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2024-09-25 00:04:59,458 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 00:04:59,458 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 738 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 00:04:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 00:04:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-09-25 00:04:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-25 00:04:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-25 00:04:59,485 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2024-09-25 00:04:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:04:59,486 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-25 00:04:59,489 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 18 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-25 00:04:59,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-25 00:04:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 00:04:59,491 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:04:59,491 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:04:59,511 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:04:59,692 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-25 00:04:59,693 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:04:59,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:04:59,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1285413673, now seen corresponding path program 1 times [2024-09-25 00:04:59,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:04:59,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631780792] [2024-09-25 00:04:59,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:04:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:04:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:59,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:04:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:59,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:04:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:04:59,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:04:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:05:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,099 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-25 00:05:00,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631780792] [2024-09-25 00:05:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631780792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:05:00,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:05:00,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:05:00,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993022383] [2024-09-25 00:05:00,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:05:00,103 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:05:00,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:00,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:05:00,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:05:00,104 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:05:00,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:00,200 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-09-25 00:05:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:05:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-09-25 00:05:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:00,201 INFO L225 Difference]: With dead ends: 80 [2024-09-25 00:05:00,202 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 00:05:00,202 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:05:00,203 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:00,203 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 201 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:05:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 00:05:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-25 00:05:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-25 00:05:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-25 00:05:00,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 40 [2024-09-25 00:05:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:00,212 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-25 00:05:00,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:05:00,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-25 00:05:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-25 00:05:00,213 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:00,213 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:00,214 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 00:05:00,214 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:00,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2101385548, now seen corresponding path program 1 times [2024-09-25 00:05:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674085877] [2024-09-25 00:05:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:05:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-25 00:05:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 00:05:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,306 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-25 00:05:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:00,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674085877] [2024-09-25 00:05:00,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674085877] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:05:00,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:05:00,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:05:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053994631] [2024-09-25 00:05:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:05:00,307 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:05:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:05:00,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:05:00,308 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:05:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:00,365 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2024-09-25 00:05:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:05:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-09-25 00:05:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:00,366 INFO L225 Difference]: With dead ends: 113 [2024-09-25 00:05:00,366 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 00:05:00,367 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-25 00:05:00,368 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 197 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-25 00:05:00,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 197 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:05:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 00:05:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-09-25 00:05:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-25 00:05:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-09-25 00:05:00,376 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 58 [2024-09-25 00:05:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:00,377 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-09-25 00:05:00,377 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:05:00,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-09-25 00:05:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-25 00:05:00,378 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:00,378 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:00,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 00:05:00,379 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:00,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:00,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1599878374, now seen corresponding path program 1 times [2024-09-25 00:05:00,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:00,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542149433] [2024-09-25 00:05:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:05:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 00:05:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 00:05:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,505 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-25 00:05:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542149433] [2024-09-25 00:05:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542149433] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598146331] [2024-09-25 00:05:00,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:00,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:00,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:00,509 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-25 00:05:00,517 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-25 00:05:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 00:05:00,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:00,596 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-25 00:05:00,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:05:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598146331] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:05:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:05:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-25 00:05:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013285206] [2024-09-25 00:05:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:05:00,598 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:05:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:00,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:05:00,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:05:00,599 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:05:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:00,644 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-09-25 00:05:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:05:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-09-25 00:05:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:00,646 INFO L225 Difference]: With dead ends: 105 [2024-09-25 00:05:00,646 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 00:05:00,646 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 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-25 00:05:00,647 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 175 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-25 00:05:00,647 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 175 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:05:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 00:05:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-25 00:05:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-25 00:05:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-09-25 00:05:00,656 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 59 [2024-09-25 00:05:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:00,656 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-09-25 00:05:00,657 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:05:00,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-09-25 00:05:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 00:05:00,657 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:00,658 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:00,675 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:05:00,862 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-25 00:05:00,863 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:00,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash -904213436, now seen corresponding path program 1 times [2024-09-25 00:05:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:00,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032186827] [2024-09-25 00:05:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:00,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:05:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 00:05:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 00:05:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,118 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-25 00:05:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:01,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032186827] [2024-09-25 00:05:01,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032186827] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:01,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989540318] [2024-09-25 00:05:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:01,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:01,121 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-25 00:05:01,122 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-25 00:05:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:01,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:05:01,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:01,288 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-25 00:05:01,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:05:01,717 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-25 00:05:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989540318] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:05:01,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:05:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-09-25 00:05:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716384723] [2024-09-25 00:05:01,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:05:01,719 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 00:05:01,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:01,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 00:05:01,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:05:01,720 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 10 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 10 states have call successors, (16) [2024-09-25 00:05:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:01,995 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-09-25 00:05:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 00:05:01,996 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 10 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 10 states have call successors, (16) Word has length 68 [2024-09-25 00:05:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:01,997 INFO L225 Difference]: With dead ends: 99 [2024-09-25 00:05:01,998 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 00:05:01,999 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 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-25 00:05:01,999 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:01,999 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 498 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:05:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 00:05:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-09-25 00:05:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.125) internal successors, (45), 43 states have internal predecessors, (45), 10 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 00:05:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-09-25 00:05:02,011 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 68 [2024-09-25 00:05:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:02,012 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-09-25 00:05:02,012 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 10 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 10 states have call successors, (16) [2024-09-25 00:05:02,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-09-25 00:05:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-25 00:05:02,013 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:02,013 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:02,033 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:05:02,214 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-25 00:05:02,215 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:02,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash -640732844, now seen corresponding path program 2 times [2024-09-25 00:05:02,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:02,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887085848] [2024-09-25 00:05:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:05:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 00:05:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 00:05:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:02,775 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-25 00:05:02,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:02,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887085848] [2024-09-25 00:05:02,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887085848] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:02,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875997837] [2024-09-25 00:05:02,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:05:02,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:02,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:02,778 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-25 00:05:02,780 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-25 00:05:02,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:05:02,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:05:02,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 00:05:02,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:03,021 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-25 00:05:03,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:05:03,912 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-25 00:05:03,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875997837] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:05:03,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:05:03,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-09-25 00:05:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384702832] [2024-09-25 00:05:03,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:05:03,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 00:05:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 00:05:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:05:03,915 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 22 states, 19 states have (on average 5.0) internal successors, (95), 22 states have internal predecessors, (95), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 12 states have call successors, (20) [2024-09-25 00:05:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:04,348 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2024-09-25 00:05:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:05:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.0) internal successors, (95), 22 states have internal predecessors, (95), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 12 states have call successors, (20) Word has length 77 [2024-09-25 00:05:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:04,350 INFO L225 Difference]: With dead ends: 157 [2024-09-25 00:05:04,350 INFO L226 Difference]: Without dead ends: 101 [2024-09-25 00:05:04,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2024-09-25 00:05:04,352 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 78 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:04,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 508 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:05:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-25 00:05:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-09-25 00:05:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (34), 14 states have call predecessors, (34), 13 states have call successors, (34) [2024-09-25 00:05:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2024-09-25 00:05:04,368 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 77 [2024-09-25 00:05:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:04,368 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2024-09-25 00:05:04,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.0) internal successors, (95), 22 states have internal predecessors, (95), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 12 states have call successors, (20) [2024-09-25 00:05:04,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2024-09-25 00:05:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-25 00:05:04,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:04,370 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:04,388 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 00:05:04,571 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-25 00:05:04,572 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:04,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1768804806, now seen corresponding path program 1 times [2024-09-25 00:05:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:04,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430601000] [2024-09-25 00:05:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:05:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:05:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 00:05:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-25 00:05:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,733 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-25 00:05:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430601000] [2024-09-25 00:05:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430601000] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:05:04,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:05:04,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:05:04,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007363590] [2024-09-25 00:05:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:05:04,735 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:05:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:05:04,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:05:04,737 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 00:05:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:04,786 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2024-09-25 00:05:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:05:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 84 [2024-09-25 00:05:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:04,790 INFO L225 Difference]: With dead ends: 185 [2024-09-25 00:05:04,790 INFO L226 Difference]: Without dead ends: 97 [2024-09-25 00:05:04,790 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-25 00:05:04,791 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 186 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-25 00:05:04,792 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 186 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:05:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-25 00:05:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-25 00:05:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 72 states have internal predecessors, (75), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (32), 14 states have call predecessors, (32), 13 states have call successors, (32) [2024-09-25 00:05:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-09-25 00:05:04,815 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 84 [2024-09-25 00:05:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:04,815 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-09-25 00:05:04,816 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 00:05:04,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-09-25 00:05:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-25 00:05:04,817 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:04,817 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:04,820 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-25 00:05:04,820 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:04,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -802082800, now seen corresponding path program 2 times [2024-09-25 00:05:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:04,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409061149] [2024-09-25 00:05:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:04,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:04,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 00:05:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 00:05:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:05:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 00:05:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 00:05:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 00:05:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 00:05:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409061149] [2024-09-25 00:05:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409061149] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569129915] [2024-09-25 00:05:05,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:05:05,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:05,303 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-25 00:05:05,304 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-25 00:05:05,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:05:05,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:05:05,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 00:05:05,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:05,755 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-25 00:05:05,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:05:07,854 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-25 00:05:07,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569129915] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:05:07,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:05:07,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2024-09-25 00:05:07,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177947384] [2024-09-25 00:05:07,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:05:07,855 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 00:05:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 00:05:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-25 00:05:07,856 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 25 states have internal predecessors, (125), 15 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (25), 7 states have call predecessors, (25), 15 states have call successors, (25) [2024-09-25 00:05:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:08,104 INFO L93 Difference]: Finished difference Result 158 states and 212 transitions. [2024-09-25 00:05:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:05:08,105 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 25 states have internal predecessors, (125), 15 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (25), 7 states have call predecessors, (25), 15 states have call successors, (25) Word has length 93 [2024-09-25 00:05:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:08,106 INFO L225 Difference]: With dead ends: 158 [2024-09-25 00:05:08,106 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:05:08,107 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 00:05:08,107 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:08,108 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 243 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:05:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:05:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:05:08,108 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-25 00:05:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:05:08,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-09-25 00:05:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:08,109 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:05:08,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.208333333333333) internal successors, (125), 25 states have internal predecessors, (125), 15 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (25), 7 states have call predecessors, (25), 15 states have call successors, (25) [2024-09-25 00:05:08,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:05:08,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:05:08,113 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:05:08,129 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 00:05:08,314 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-25 00:05:08,320 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:08,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:05:10,516 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:05:10,542 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 00:05:10,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:05:10 BoogieIcfgContainer [2024-09-25 00:05:10,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:05:10,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:05:10,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:05:10,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:05:10,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:04:55" (3/4) ... [2024-09-25 00:05:10,552 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:05:10,608 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:05:10,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:05:10,609 INFO L158 Benchmark]: Toolchain (without parser) took 16256.02ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 101.7MB in the beginning and 291.9MB in the end (delta: -190.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:05:10,609 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 121.6MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:05:10,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.76ms. Allocated memory is still 172.0MB. Free memory was 101.5MB in the beginning and 89.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:05:10,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.19ms. Allocated memory is still 172.0MB. Free memory was 89.6MB in the beginning and 143.4MB in the end (delta: -53.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-09-25 00:05:10,610 INFO L158 Benchmark]: Boogie Preprocessor took 46.98ms. Allocated memory is still 172.0MB. Free memory was 143.4MB in the beginning and 141.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:05:10,610 INFO L158 Benchmark]: RCFGBuilder took 449.33ms. Allocated memory is still 172.0MB. Free memory was 141.5MB in the beginning and 125.5MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 00:05:10,611 INFO L158 Benchmark]: TraceAbstraction took 15340.08ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 124.8MB in the beginning and 294.0MB in the end (delta: -169.2MB). Peak memory consumption was 184.8MB. Max. memory is 16.1GB. [2024-09-25 00:05:10,611 INFO L158 Benchmark]: Witness Printer took 60.13ms. Allocated memory is still 339.7MB. Free memory was 294.0MB in the beginning and 291.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:05:10,612 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 121.6MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.76ms. Allocated memory is still 172.0MB. Free memory was 101.5MB in the beginning and 89.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.19ms. Allocated memory is still 172.0MB. Free memory was 89.6MB in the beginning and 143.4MB in the end (delta: -53.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.98ms. Allocated memory is still 172.0MB. Free memory was 143.4MB in the beginning and 141.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.33ms. Allocated memory is still 172.0MB. Free memory was 141.5MB in the beginning and 125.5MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15340.08ms. Allocated memory was 172.0MB in the beginning and 339.7MB in the end (delta: 167.8MB). Free memory was 124.8MB in the beginning and 294.0MB in the end (delta: -169.2MB). Peak memory consumption was 184.8MB. Max. memory is 16.1GB. * Witness Printer took 60.13ms. Allocated memory is still 339.7MB. Free memory was 294.0MB in the beginning and 291.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 7 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 4316 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3584 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1767 IncrementalHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 732 mSDtfsCounter, 1767 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 805 SyntacticMatches, 19 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=11, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 24 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1034 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1323 ConstructedInterpolants, 0 QuantifiedInterpolants, 3220 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 287/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 - ProcedureContractResult [Line: 31]: Procedure Contract for multiple_of Derived contract for procedure multiple_of. Ensures: (((((((long long) m * 2) < ((long long) n + 1)) || (n == m)) || (n == 0)) || (((long long) n + m) < 1)) || (m < 1)) - ProcedureContractResult [Line: 17]: Procedure Contract for mult Derived contract for procedure mult. Ensures: ((((2 < \result) || (\result == 0)) || (m < 2)) || (n < 2)) - ProcedureContractResult [Line: 52]: Procedure Contract for is_prime Derived contract for procedure is_prime. Ensures: ((n < 3) || (\result == 0)) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:05:10,642 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE