./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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:23:57,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:23:57,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:23:57,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:23:57,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:23:57,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:23:57,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:23:57,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:23:57,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:23:57,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:23:57,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:23:57,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:23:57,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:23:57,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:23:57,640 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:23:57,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:23:57,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:23:57,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:23:57,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:23:57,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:23:57,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:23:57,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:23:57,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:23:57,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:23:57,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:23:57,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:23:57,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:23:57,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:23:57,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:23:57,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:23:57,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:23:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:23:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:23:57,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:23:57,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:23:57,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:23:57,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:23:57,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:23:57,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:23:57,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:23:57,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:23:57,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:23:57,652 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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 11:23:57,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:23:57,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:23:57,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:23:58,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:23:58,001 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:23:58,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Primes.c [2024-09-25 11:23:59,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:23:59,705 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:23:59,705 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c [2024-09-25 11:23:59,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d44d52758/53d46565866644be90bcb209369850cd/FLAG2574522be [2024-09-25 11:23:59,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d44d52758/53d46565866644be90bcb209369850cd [2024-09-25 11:23:59,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:23:59,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:23:59,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:23:59,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:23:59,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:23:59,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:23:59,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7734c6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59, skipping insertion in model container [2024-09-25 11:23:59,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:23:59,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:23:59,903 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 11:23:59,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:23:59,919 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:23:59,945 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 11:23:59,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:23:59,967 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:23:59,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59 WrapperNode [2024-09-25 11:23:59,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:23:59,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:23:59,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:23:59,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:23:59,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:23:59,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:23:59,990 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:23:59,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:23:59,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:23:59,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:23:59,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:24:00,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,032 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 11:24:00,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:24:00,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:24:00,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:24:00,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:24:00,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (1/1) ... [2024-09-25 11:24:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:24:00,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:00,086 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 11:24:00,090 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 11:24:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-09-25 11:24:00,134 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-09-25 11:24:00,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:24:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-09-25 11:24:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-09-25 11:24:00,135 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-09-25 11:24:00,135 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-09-25 11:24:00,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:24:00,137 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:24:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:24:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2024-09-25 11:24:00,137 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2024-09-25 11:24:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:24:00,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:24:00,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:24:00,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:24:00,214 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:24:00,216 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:24:00,480 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-25 11:24:00,481 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:24:00,506 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:24:00,507 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:24:00,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:24:00 BoogieIcfgContainer [2024-09-25 11:24:00,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:24:00,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:24:00,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:24:00,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:24:00,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:23:59" (1/3) ... [2024-09-25 11:24:00,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586c981d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:24:00, skipping insertion in model container [2024-09-25 11:24:00,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:59" (2/3) ... [2024-09-25 11:24:00,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586c981d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:24:00, skipping insertion in model container [2024-09-25 11:24:00,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:24:00" (3/3) ... [2024-09-25 11:24:00,520 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-09-25 11:24:00,535 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:24:00,536 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:24:00,586 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:24:00,592 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;@13e8a7b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:24:00,592 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:24:00,596 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 11:24:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 11:24:00,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:00,603 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 11:24:00,604 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:00,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash 745641163, now seen corresponding path program 1 times [2024-09-25 11:24:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:00,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455372682] [2024-09-25 11:24:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:00,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:00,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:00,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:00,858 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 11:24:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:00,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455372682] [2024-09-25 11:24:00,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455372682] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:00,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:00,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 11:24:00,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604371460] [2024-09-25 11:24:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:00,865 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 11:24:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:00,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 11:24:00,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 11:24:00,889 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 11:24:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:00,947 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-09-25 11:24:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 11:24:00,950 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 11:24:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:00,958 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:24:00,958 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 11:24:00,961 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 11:24:00,964 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 11:24:00,965 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 11:24:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 11:24:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-25 11:24:01,002 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 11:24:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-09-25 11:24:01,007 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 21 [2024-09-25 11:24:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:01,009 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-09-25 11:24:01,009 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 11:24:01,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-09-25 11:24:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 11:24:01,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:01,015 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 11:24:01,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:24:01,016 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:01,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1491686554, now seen corresponding path program 1 times [2024-09-25 11:24:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:01,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592785139] [2024-09-25 11:24:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-25 11:24:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,393 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 11:24:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592785139] [2024-09-25 11:24:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592785139] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:01,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:01,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 11:24:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102105506] [2024-09-25 11:24:01,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:01,396 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:24:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:24:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:24:01,397 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 11:24:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:01,458 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-09-25 11:24:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:24:01,463 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 11:24:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:01,466 INFO L225 Difference]: With dead ends: 78 [2024-09-25 11:24:01,466 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 11:24:01,468 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:24:01,469 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 11:24:01,469 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 11:24:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 11:24:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 11:24:01,486 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 11:24:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-09-25 11:24:01,488 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 28 [2024-09-25 11:24:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:01,488 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-09-25 11:24:01,489 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 11:24:01,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-09-25 11:24:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 11:24:01,491 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:01,491 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 11:24:01,491 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:24:01,491 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:01,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1689656639, now seen corresponding path program 1 times [2024-09-25 11:24:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123539273] [2024-09-25 11:24:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 11:24:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,653 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 11:24:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:01,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123539273] [2024-09-25 11:24:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123539273] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:01,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:01,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:24:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307208988] [2024-09-25 11:24:01,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:01,656 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:24:01,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:01,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:24:01,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:24:01,657 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 11:24:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:01,702 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-09-25 11:24:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:24:01,703 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 11:24:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:01,704 INFO L225 Difference]: With dead ends: 63 [2024-09-25 11:24:01,704 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 11:24:01,705 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 11:24:01,706 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 11:24:01,707 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 11:24:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 11:24:01,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-25 11:24:01,718 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 11:24:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-25 11:24:01,722 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2024-09-25 11:24:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:01,723 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-25 11:24:01,723 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 11:24:01,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-25 11:24:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 11:24:01,726 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:01,726 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 11:24:01,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:24:01,727 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:01,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash -145981177, now seen corresponding path program 1 times [2024-09-25 11:24:01,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:01,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221218109] [2024-09-25 11:24:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:01,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,786 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 11:24:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:24:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221218109] [2024-09-25 11:24:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221218109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:24:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699165453] [2024-09-25 11:24:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:01,831 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:24:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:24:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:24:01,832 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 11:24:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:01,925 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-09-25 11:24:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:24:01,926 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 11:24:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:01,928 INFO L225 Difference]: With dead ends: 67 [2024-09-25 11:24:01,928 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 11:24:01,928 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 11:24:01,929 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 11:24:01,930 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 11:24:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 11:24:01,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-09-25 11:24:01,942 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 11:24:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-25 11:24:01,945 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-09-25 11:24:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:01,945 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-25 11:24:01,946 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 11:24:01,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-25 11:24:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 11:24:01,947 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:01,947 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 11:24:01,948 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 11:24:01,948 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:01,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:01,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1109477137, now seen corresponding path program 1 times [2024-09-25 11:24:01,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:01,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244395937] [2024-09-25 11:24:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 11:24:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,098 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 11:24:02,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:02,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244395937] [2024-09-25 11:24:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244395937] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:24:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98906849] [2024-09-25 11:24:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:24:02,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:02,105 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 11:24:02,106 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 11:24:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:24:02,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:24:02,267 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 11:24:02,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:24:02,492 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 11:24:02,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98906849] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:24:02,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:24:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-25 11:24:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146430221] [2024-09-25 11:24:02,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:24:02,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 11:24:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:02,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 11:24:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:24:02,498 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 11:24:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:02,621 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-09-25 11:24:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:24:02,622 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 11:24:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:02,623 INFO L225 Difference]: With dead ends: 76 [2024-09-25 11:24:02,624 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 11:24:02,624 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 11:24:02,625 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 11:24:02,625 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 11:24:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 11:24:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 11:24:02,636 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 11:24:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-09-25 11:24:02,637 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 37 [2024-09-25 11:24:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:02,637 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-09-25 11:24:02,637 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 11:24:02,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-09-25 11:24:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 11:24:02,639 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:02,639 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 11:24:02,659 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 11:24:02,846 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 11:24:02,847 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:02,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -466412443, now seen corresponding path program 1 times [2024-09-25 11:24:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:02,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407922357] [2024-09-25 11:24:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:02,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:03,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:03,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 11:24:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:03,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:03,166 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 11:24:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407922357] [2024-09-25 11:24:03,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407922357] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:24:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522287249] [2024-09-25 11:24:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:03,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:24:03,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:03,170 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 11:24:03,172 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 11:24:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:03,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 11:24:03,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:24:03,406 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 11:24:03,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:24:03,825 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 11:24:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522287249] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:24:03,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:24:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-09-25 11:24:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989949097] [2024-09-25 11:24:03,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:24:03,827 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:24:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:24:03,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:24:03,828 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 11:24:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:04,138 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2024-09-25 11:24:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 11:24:04,139 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 11:24:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:04,140 INFO L225 Difference]: With dead ends: 79 [2024-09-25 11:24:04,140 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 11:24:04,141 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:24:04,141 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 35 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:24:04,142 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.2s Time] [2024-09-25 11:24:04,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 11:24:04,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-09-25 11:24:04,153 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 11:24:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-25 11:24:04,154 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2024-09-25 11:24:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:04,154 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-25 11:24:04,154 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 11:24:04,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-25 11:24:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 11:24:04,156 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:04,156 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 11:24:04,176 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 11:24:04,360 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 11:24:04,361 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:04,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1285413673, now seen corresponding path program 1 times [2024-09-25 11:24:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:04,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546444695] [2024-09-25 11:24:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:24:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,482 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 11:24:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546444695] [2024-09-25 11:24:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546444695] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:04,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:04,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 11:24:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167451647] [2024-09-25 11:24:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:04,483 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:24:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:24:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:24:04,484 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 11:24:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:04,523 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-09-25 11:24:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:24:04,523 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 11:24:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:04,524 INFO L225 Difference]: With dead ends: 80 [2024-09-25 11:24:04,525 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 11:24:04,525 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:24:04,526 INFO L434 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:24:04,526 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.0s Time] [2024-09-25 11:24:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 11:24:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-25 11:24:04,539 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 11:24:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-25 11:24:04,541 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 40 [2024-09-25 11:24:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:04,542 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-25 11:24:04,542 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 11:24:04,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-25 11:24:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-25 11:24:04,545 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:04,545 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 11:24:04,545 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 11:24:04,545 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:04,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2101385548, now seen corresponding path program 1 times [2024-09-25 11:24:04,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:04,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868520862] [2024-09-25 11:24:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:04,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-25 11:24:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:24:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,676 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 11:24:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868520862] [2024-09-25 11:24:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868520862] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:04,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:04,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:24:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591766538] [2024-09-25 11:24:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:04,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:24:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:24:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:24:04,680 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 11:24:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:04,746 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2024-09-25 11:24:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:24:04,746 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 11:24:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:04,747 INFO L225 Difference]: With dead ends: 113 [2024-09-25 11:24:04,747 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 11:24:04,748 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 11:24:04,749 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 11:24:04,749 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 11:24:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 11:24:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-09-25 11:24:04,762 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 11:24:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-09-25 11:24:04,763 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 58 [2024-09-25 11:24:04,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:04,764 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-09-25 11:24:04,765 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 11:24:04,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:04,765 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-09-25 11:24:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-25 11:24:04,766 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:04,766 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 11:24:04,767 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-25 11:24:04,767 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:04,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:04,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1599878374, now seen corresponding path program 1 times [2024-09-25 11:24:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:04,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983880446] [2024-09-25 11:24:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-25 11:24:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 11:24:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,884 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 11:24:04,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:04,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983880446] [2024-09-25 11:24:04,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983880446] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:24:04,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030350166] [2024-09-25 11:24:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:24:04,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:04,887 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 11:24:04,888 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 11:24:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:04,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 11:24:04,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:24:04,971 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 11:24:04,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:24:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030350166] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:04,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:24:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-25 11:24:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732914714] [2024-09-25 11:24:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:04,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:24:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:24:04,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:24:04,978 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 11:24:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:05,032 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-09-25 11:24:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:24:05,033 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 11:24:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:05,034 INFO L225 Difference]: With dead ends: 105 [2024-09-25 11:24:05,034 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 11:24:05,035 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 11:24:05,035 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 11:24:05,035 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 11:24:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 11:24:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-25 11:24:05,043 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 11:24:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-09-25 11:24:05,044 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 59 [2024-09-25 11:24:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:05,045 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-09-25 11:24:05,045 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 11:24:05,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-09-25 11:24:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-25 11:24:05,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:05,046 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 11:24:05,063 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 11:24:05,247 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 11:24:05,247 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:05,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:05,248 INFO L85 PathProgramCache]: Analyzing trace with hash -904213436, now seen corresponding path program 1 times [2024-09-25 11:24:05,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:05,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132969707] [2024-09-25 11:24:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:05,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-25 11:24:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:24:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,520 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 11:24:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132969707] [2024-09-25 11:24:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132969707] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:24:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712987353] [2024-09-25 11:24:05,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:05,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:24:05,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:05,524 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 11:24:05,525 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 11:24:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:05,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 11:24:05,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:24:05,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 11:24:05,717 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:24:06,182 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 11:24:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712987353] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:24:06,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:24:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-09-25 11:24:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530179235] [2024-09-25 11:24:06,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:24:06,186 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 11:24:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:06,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 11:24:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:24:06,187 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 11:24:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:06,491 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-09-25 11:24:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 11:24:06,492 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 11:24:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:06,493 INFO L225 Difference]: With dead ends: 99 [2024-09-25 11:24:06,494 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 11:24:06,494 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 11:24:06,495 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 11:24:06,495 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 11:24:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 11:24:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-09-25 11:24:06,507 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 11:24:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-09-25 11:24:06,508 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 68 [2024-09-25 11:24:06,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:06,509 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-09-25 11:24:06,509 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 11:24:06,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-09-25 11:24:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-25 11:24:06,510 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:06,511 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 11:24:06,529 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 11:24:06,715 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 11:24:06,716 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:06,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -640732844, now seen corresponding path program 2 times [2024-09-25 11:24:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085538918] [2024-09-25 11:24:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:06,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:06,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:06,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:06,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:06,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:07,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:07,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:24:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:07,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 11:24:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:07,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:07,072 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 11:24:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085538918] [2024-09-25 11:24:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085538918] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:24:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490799538] [2024-09-25 11:24:07,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:24:07,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:24:07,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:07,074 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 11:24:07,076 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 11:24:07,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:24:07,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:24:07,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 11:24:07,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:24:07,320 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 11:24:07,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:24:08,156 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 11:24:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490799538] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:24:08,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:24:08,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-09-25 11:24:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535107976] [2024-09-25 11:24:08,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:24:08,157 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 11:24:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 11:24:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-09-25 11:24:08,159 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 11:24:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:08,600 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2024-09-25 11:24:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 11:24:08,601 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 11:24:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:08,602 INFO L225 Difference]: With dead ends: 157 [2024-09-25 11:24:08,602 INFO L226 Difference]: Without dead ends: 101 [2024-09-25 11:24:08,603 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 11:24:08,604 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 78 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:24:08,604 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 508 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:24:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-25 11:24:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-09-25 11:24:08,628 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 11:24:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2024-09-25 11:24:08,630 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 77 [2024-09-25 11:24:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:08,630 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2024-09-25 11:24:08,630 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 11:24:08,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:08,631 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2024-09-25 11:24:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-25 11:24:08,633 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:08,633 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 11:24:08,645 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 11:24:08,833 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 11:24:08,834 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:08,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:08,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1768804806, now seen corresponding path program 1 times [2024-09-25 11:24:08,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:08,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397451229] [2024-09-25 11:24:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:24:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:24:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-25 11:24:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:08,999 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 11:24:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397451229] [2024-09-25 11:24:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397451229] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:24:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:24:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:24:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456738811] [2024-09-25 11:24:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:24:09,002 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:24:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:24:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:24:09,004 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 11:24:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:09,058 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2024-09-25 11:24:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:24:09,059 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 11:24:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:09,060 INFO L225 Difference]: With dead ends: 185 [2024-09-25 11:24:09,060 INFO L226 Difference]: Without dead ends: 97 [2024-09-25 11:24:09,061 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 11:24:09,061 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 11:24:09,062 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 11:24:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-25 11:24:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-25 11:24:09,074 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 11:24:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-09-25 11:24:09,075 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 84 [2024-09-25 11:24:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:09,076 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-09-25 11:24:09,076 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 11:24:09,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-09-25 11:24:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-25 11:24:09,077 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:24:09,077 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 11:24:09,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-25 11:24:09,078 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:24:09,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -802082800, now seen corresponding path program 2 times [2024-09-25 11:24:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:24:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55241259] [2024-09-25 11:24:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:24:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:24:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:24:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 11:24:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-25 11:24:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:24:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:24:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-25 11:24:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 11:24:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:24:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:24:09,425 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 11:24:09,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:24:09,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55241259] [2024-09-25 11:24:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55241259] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:24:09,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485032493] [2024-09-25 11:24:09,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:24:09,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:24:09,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:24:09,428 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 11:24:09,429 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 11:24:09,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:24:09,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:24:09,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 11:24:09,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:24:09,718 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 11:24:09,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:24:11,630 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 11:24:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485032493] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:24:11,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:24:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2024-09-25 11:24:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076206284] [2024-09-25 11:24:11,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:24:11,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 11:24:11,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:24:11,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 11:24:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-25 11:24:11,633 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 11:24:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:24:11,871 INFO L93 Difference]: Finished difference Result 158 states and 212 transitions. [2024-09-25 11:24:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 11:24:11,871 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 11:24:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:24:11,872 INFO L225 Difference]: With dead ends: 158 [2024-09-25 11:24:11,872 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:24:11,873 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 11:24:11,874 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 11:24:11,874 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 11:24:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:24:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:24:11,875 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 11:24:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:24:11,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-09-25 11:24:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:24:11,876 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:24:11,876 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 11:24:11,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:24:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:24:11,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:24:11,879 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:24:11,901 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 11:24:12,089 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 11:24:12,093 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:24:12,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:24:13,614 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:24:13,630 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,631 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,634 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,634 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,635 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,635 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,635 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,635 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,636 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,636 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,641 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 11:24:13,642 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,643 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,644 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,644 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:24:13,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:24:13,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:24:13,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,645 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:24:13,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:24:13 BoogieIcfgContainer [2024-09-25 11:24:13,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:24:13,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:24:13,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:24:13,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:24:13,647 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:24:00" (3/4) ... [2024-09-25 11:24:13,649 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:24:13,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:24:13,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:24:13,700 INFO L158 Benchmark]: Toolchain (without parser) took 13972.53ms. Allocated memory was 65.0MB in the beginning and 209.7MB in the end (delta: 144.7MB). Free memory was 35.4MB in the beginning and 131.2MB in the end (delta: -95.9MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-09-25 11:24:13,700 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:24:13,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.95ms. Allocated memory is still 65.0MB. Free memory was 35.2MB in the beginning and 41.2MB in the end (delta: -6.0MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-09-25 11:24:13,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.86ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 40.2MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:24:13,701 INFO L158 Benchmark]: Boogie Preprocessor took 57.81ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 38.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:24:13,701 INFO L158 Benchmark]: RCFGBuilder took 458.60ms. Allocated memory is still 65.0MB. Free memory was 38.1MB in the beginning and 39.4MB in the end (delta: -1.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 11:24:13,702 INFO L158 Benchmark]: TraceAbstraction took 13133.64ms. Allocated memory was 65.0MB in the beginning and 209.7MB in the end (delta: 144.7MB). Free memory was 38.8MB in the beginning and 133.3MB in the end (delta: -94.5MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2024-09-25 11:24:13,702 INFO L158 Benchmark]: Witness Printer took 53.14ms. Allocated memory is still 209.7MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:24:13,703 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.17ms. Allocated memory is still 48.2MB. Free memory was 28.5MB in the beginning and 28.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.95ms. Allocated memory is still 65.0MB. Free memory was 35.2MB in the beginning and 41.2MB in the end (delta: -6.0MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.86ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 40.2MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.81ms. Allocated memory is still 65.0MB. Free memory was 39.9MB in the beginning and 38.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.60ms. Allocated memory is still 65.0MB. Free memory was 38.1MB in the beginning and 39.4MB in the end (delta: -1.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13133.64ms. Allocated memory was 65.0MB in the beginning and 209.7MB in the end (delta: 144.7MB). Free memory was 38.8MB in the beginning and 133.3MB in the end (delta: -94.5MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * Witness Printer took 53.14ms. Allocated memory is still 209.7MB. Free memory was 133.3MB in the beginning and 131.2MB 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: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 11.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 328 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 4316 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3584 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1761 IncrementalHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 732 mSDtfsCounter, 1761 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 805 SyntacticMatches, 19 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.6s 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, 7.2s 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 11:24:13,741 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