./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Primes.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:47:01,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:47:01,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:47:01,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:47:01,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:47:01,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:47:01,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:47:01,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:47:01,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:47:01,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:47:01,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:47:01,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:47:01,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:47:01,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:47:01,440 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:47:01,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:47:01,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:47:01,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:47:01,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:47:01,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:47:01,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:47:01,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:47:01,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:47:01,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:47:01,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:47:01,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:47:01,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:47:01,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:47:01,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:47:01,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:47:01,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:47:01,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:47:01,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:47:01,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:47:01,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:47:01,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:47:01,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:47:01,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:47:01,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:47:01,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:47:01,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:47:01,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:47:01,453 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 19:47:01,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:47:01,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:47:01,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:47:01,769 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:47:01,770 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:47:01,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Primes.c [2024-09-20 19:47:03,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:47:03,336 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:47:03,337 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Primes.c [2024-09-20 19:47:03,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/981b84a40/69ef82156ec540c18deaf256fd83f9f8/FLAGd9dc1dddc [2024-09-20 19:47:03,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/981b84a40/69ef82156ec540c18deaf256fd83f9f8 [2024-09-20 19:47:03,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:47:03,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:47:03,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:47:03,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:47:03,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:47:03,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a516b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03, skipping insertion in model container [2024-09-20 19:47:03,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:47:03,584 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-20 19:47:03,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:47:03,608 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:47:03,634 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-20 19:47:03,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:47:03,650 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:47:03,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03 WrapperNode [2024-09-20 19:47:03,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:47:03,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:47:03,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:47:03,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:47:03,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,678 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:47:03,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:47:03,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:47:03,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:47:03,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:47:03,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,707 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-20 19:47:03,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:47:03,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:47:03,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:47:03,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:47:03,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (1/1) ... [2024-09-20 19:47:03,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:47:03,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:03,755 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-20 19:47:03,760 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-20 19:47:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-09-20 19:47:03,799 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-09-20 19:47:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:47:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-09-20 19:47:03,799 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-09-20 19:47:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-09-20 19:47:03,799 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-09-20 19:47:03,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:47:03,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:47:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:47:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2024-09-20 19:47:03,800 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2024-09-20 19:47:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:47:03,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:47:03,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:47:03,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:47:03,858 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:47:03,860 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:47:04,114 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-20 19:47:04,114 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:47:04,147 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:47:04,148 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 19:47:04,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:47:04 BoogieIcfgContainer [2024-09-20 19:47:04,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:47:04,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:47:04,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:47:04,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:47:04,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:47:03" (1/3) ... [2024-09-20 19:47:04,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1aedbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:47:04, skipping insertion in model container [2024-09-20 19:47:04,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:47:03" (2/3) ... [2024-09-20 19:47:04,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1aedbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:47:04, skipping insertion in model container [2024-09-20 19:47:04,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:47:04" (3/3) ... [2024-09-20 19:47:04,160 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-09-20 19:47:04,179 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:47:04,179 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:47:04,247 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:47:04,255 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;@39b8c963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:47:04,256 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:47:04,261 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-20 19:47:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 19:47:04,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:04,270 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-20 19:47:04,270 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:04,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 745641163, now seen corresponding path program 1 times [2024-09-20 19:47:04,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:04,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268745266] [2024-09-20 19:47:04,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:04,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,499 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-20 19:47:04,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:04,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268745266] [2024-09-20 19:47:04,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268745266] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:04,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 19:47:04,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434636052] [2024-09-20 19:47:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:04,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 19:47:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 19:47:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 19:47:04,529 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-20 19:47:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:04,567 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2024-09-20 19:47:04,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 19:47:04,569 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-20 19:47:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:04,576 INFO L225 Difference]: With dead ends: 66 [2024-09-20 19:47:04,577 INFO L226 Difference]: Without dead ends: 55 [2024-09-20 19:47:04,579 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-20 19:47:04,583 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-20 19:47:04,586 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-20 19:47:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-20 19:47:04,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-20 19:47:04,621 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-20 19:47:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2024-09-20 19:47:04,624 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 21 [2024-09-20 19:47:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:04,626 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2024-09-20 19:47:04,626 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-20 19:47:04,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2024-09-20 19:47:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 19:47:04,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:04,629 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-20 19:47:04,629 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:47:04,630 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:04,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1491686554, now seen corresponding path program 1 times [2024-09-20 19:47:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:04,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558199846] [2024-09-20 19:47:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-20 19:47:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:04,955 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-20 19:47:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558199846] [2024-09-20 19:47:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558199846] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 19:47:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548782189] [2024-09-20 19:47:04,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:04,957 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 19:47:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 19:47:04,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 19:47:04,959 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-20 19:47:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:05,029 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-09-20 19:47:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 19:47:05,030 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-20 19:47:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:05,034 INFO L225 Difference]: With dead ends: 78 [2024-09-20 19:47:05,036 INFO L226 Difference]: Without dead ends: 57 [2024-09-20 19:47:05,037 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 19:47:05,038 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-20 19:47:05,039 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-20 19:47:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-20 19:47:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-20 19:47:05,052 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-20 19:47:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-09-20 19:47:05,054 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 28 [2024-09-20 19:47:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:05,054 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-09-20 19:47:05,055 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-20 19:47:05,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-09-20 19:47:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-20 19:47:05,057 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:05,057 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-20 19:47:05,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:47:05,058 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:05,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1689656639, now seen corresponding path program 1 times [2024-09-20 19:47:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064724411] [2024-09-20 19:47:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:47:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,242 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-20 19:47:05,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:05,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064724411] [2024-09-20 19:47:05,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064724411] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:05,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:05,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 19:47:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295277234] [2024-09-20 19:47:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:05,244 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 19:47:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:05,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 19:47:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-20 19:47:05,247 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-20 19:47:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:05,301 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-09-20 19:47:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 19:47:05,302 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-20 19:47:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:05,304 INFO L225 Difference]: With dead ends: 63 [2024-09-20 19:47:05,304 INFO L226 Difference]: Without dead ends: 59 [2024-09-20 19:47:05,304 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-20 19:47:05,305 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-20 19:47:05,306 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-20 19:47:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-20 19:47:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-20 19:47:05,322 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-20 19:47:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-20 19:47:05,326 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2024-09-20 19:47:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:05,326 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-20 19:47:05,326 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-20 19:47:05,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-20 19:47:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-20 19:47:05,330 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:05,330 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-20 19:47:05,332 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 19:47:05,332 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:05,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash -145981177, now seen corresponding path program 1 times [2024-09-20 19:47:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:05,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289310977] [2024-09-20 19:47:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:47:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:47:05,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289310977] [2024-09-20 19:47:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289310977] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:05,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:47:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720214418] [2024-09-20 19:47:05,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:05,460 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:47:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:05,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:47:05,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:47:05,462 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-20 19:47:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:05,561 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-09-20 19:47:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 19:47:05,563 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-20 19:47:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:05,564 INFO L225 Difference]: With dead ends: 67 [2024-09-20 19:47:05,567 INFO L226 Difference]: Without dead ends: 63 [2024-09-20 19:47:05,568 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-20 19:47:05,569 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-20 19:47:05,572 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-20 19:47:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-20 19:47:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-09-20 19:47:05,586 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-20 19:47:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-09-20 19:47:05,590 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-09-20 19:47:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:05,591 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-09-20 19:47:05,591 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-20 19:47:05,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-09-20 19:47:05,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-20 19:47:05,596 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:05,596 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-20 19:47:05,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 19:47:05,597 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:05,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:05,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1109477137, now seen corresponding path program 1 times [2024-09-20 19:47:05,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:05,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403637366] [2024-09-20 19:47:05,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:05,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:47:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,734 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-20 19:47:05,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403637366] [2024-09-20 19:47:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403637366] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:47:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647231405] [2024-09-20 19:47:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:05,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:47:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:05,739 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-20 19:47:05,741 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-20 19:47:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:05,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:47:05,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:47:05,886 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-20 19:47:05,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:47:06,091 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-20 19:47:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647231405] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:47:06,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:47:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-20 19:47:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237712353] [2024-09-20 19:47:06,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:47:06,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 19:47:06,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 19:47:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-20 19:47:06,094 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-20 19:47:06,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:06,254 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-09-20 19:47:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 19:47:06,255 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-20 19:47:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:06,257 INFO L225 Difference]: With dead ends: 76 [2024-09-20 19:47:06,259 INFO L226 Difference]: Without dead ends: 57 [2024-09-20 19:47:06,260 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-20 19:47:06,260 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-20 19:47:06,261 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-20 19:47:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-20 19:47:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-20 19:47:06,268 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-20 19:47:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-09-20 19:47:06,269 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 37 [2024-09-20 19:47:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:06,270 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-09-20 19:47:06,270 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-20 19:47:06,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-09-20 19:47:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-20 19:47:06,271 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:06,272 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-20 19:47:06,287 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 19:47:06,475 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-20 19:47:06,476 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:06,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash -466412443, now seen corresponding path program 1 times [2024-09-20 19:47:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767524911] [2024-09-20 19:47:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 19:47:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,743 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-20 19:47:06,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:06,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767524911] [2024-09-20 19:47:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767524911] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:47:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265667769] [2024-09-20 19:47:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:47:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:06,747 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-20 19:47:06,748 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-20 19:47:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:06,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-20 19:47:06,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:47:06,982 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-20 19:47:06,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:47:07,366 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-20 19:47:07,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265667769] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:47:07,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:47:07,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-09-20 19:47:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274122848] [2024-09-20 19:47:07,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:47:07,367 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-20 19:47:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-20 19:47:07,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2024-09-20 19:47:07,369 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-20 19:47:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:07,679 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2024-09-20 19:47:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-20 19:47:07,680 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-20 19:47:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:07,682 INFO L225 Difference]: With dead ends: 79 [2024-09-20 19:47:07,682 INFO L226 Difference]: Without dead ends: 60 [2024-09-20 19:47:07,683 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-20 19:47:07,683 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-20 19:47:07,684 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-20 19:47:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-20 19:47:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2024-09-20 19:47:07,691 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-20 19:47:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-20 19:47:07,695 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2024-09-20 19:47:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:07,695 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-20 19:47:07,695 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-20 19:47:07,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-20 19:47:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 19:47:07,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:07,697 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-20 19:47:07,715 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 19:47:07,897 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-20 19:47:07,898 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:07,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:07,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1285413673, now seen corresponding path program 1 times [2024-09-20 19:47:07,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:07,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443413082] [2024-09-20 19:47:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:07,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:07,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:07,942 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 19:47:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,006 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-20 19:47:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:08,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443413082] [2024-09-20 19:47:08,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443413082] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:08,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:08,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-20 19:47:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84335944] [2024-09-20 19:47:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:08,008 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 19:47:08,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:08,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 19:47:08,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-20 19:47:08,009 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-20 19:47:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:08,052 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-09-20 19:47:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 19:47:08,052 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-20 19:47:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:08,064 INFO L225 Difference]: With dead ends: 80 [2024-09-20 19:47:08,064 INFO L226 Difference]: Without dead ends: 59 [2024-09-20 19:47:08,065 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-20 19:47:08,065 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-20 19:47:08,066 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-20 19:47:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-20 19:47:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-20 19:47:08,078 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-20 19:47:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2024-09-20 19:47:08,079 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 40 [2024-09-20 19:47:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:08,079 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2024-09-20 19:47:08,079 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-20 19:47:08,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2024-09-20 19:47:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-20 19:47:08,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:08,081 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-20 19:47:08,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-20 19:47:08,081 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:08,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2101385548, now seen corresponding path program 1 times [2024-09-20 19:47:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772854478] [2024-09-20 19:47:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:08,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-20 19:47:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-20 19:47:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,194 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-20 19:47:08,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:08,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772854478] [2024-09-20 19:47:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772854478] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:08,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:47:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283713018] [2024-09-20 19:47:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:08,198 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:47:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:47:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:47:08,199 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-20 19:47:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:08,255 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2024-09-20 19:47:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 19:47:08,256 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-20 19:47:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:08,258 INFO L225 Difference]: With dead ends: 113 [2024-09-20 19:47:08,258 INFO L226 Difference]: Without dead ends: 57 [2024-09-20 19:47:08,258 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-20 19:47:08,259 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-20 19:47:08,259 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-20 19:47:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-20 19:47:08,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-09-20 19:47:08,272 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-20 19:47:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-09-20 19:47:08,273 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 58 [2024-09-20 19:47:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:08,273 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-09-20 19:47:08,273 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-20 19:47:08,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:08,274 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-09-20 19:47:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 19:47:08,274 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:08,275 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-20 19:47:08,275 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 19:47:08,275 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:08,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1599878374, now seen corresponding path program 1 times [2024-09-20 19:47:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:08,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343717925] [2024-09-20 19:47:08,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:08,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 19:47:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-20 19:47:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,386 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-20 19:47:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343717925] [2024-09-20 19:47:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343717925] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:47:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964180415] [2024-09-20 19:47:08,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:47:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:08,389 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-20 19:47:08,390 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-20 19:47:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 19:47:08,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:47:08,476 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-20 19:47:08,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:47:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964180415] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:08,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 19:47:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-20 19:47:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663066722] [2024-09-20 19:47:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:08,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:47:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:47:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 19:47:08,478 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-20 19:47:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:08,536 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-09-20 19:47:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 19:47:08,537 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-20 19:47:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:08,538 INFO L225 Difference]: With dead ends: 105 [2024-09-20 19:47:08,538 INFO L226 Difference]: Without dead ends: 59 [2024-09-20 19:47:08,539 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-20 19:47:08,540 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-20 19:47:08,541 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-20 19:47:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-20 19:47:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-09-20 19:47:08,553 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-20 19:47:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-09-20 19:47:08,556 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 59 [2024-09-20 19:47:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:08,557 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-09-20 19:47:08,557 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-20 19:47:08,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-09-20 19:47:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-20 19:47:08,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:08,558 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-20 19:47:08,575 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 19:47:08,758 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-20 19:47:08,759 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:08,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash -904213436, now seen corresponding path program 1 times [2024-09-20 19:47:08,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:08,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075577520] [2024-09-20 19:47:08,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:08,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:09,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-20 19:47:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:09,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-20 19:47:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:09,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:09,050 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-20 19:47:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075577520] [2024-09-20 19:47:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075577520] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:47:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387371520] [2024-09-20 19:47:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:09,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:47:09,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:09,052 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-20 19:47:09,053 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-20 19:47:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:09,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 19:47:09,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:47:09,231 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-20 19:47:09,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:47:09,694 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-20 19:47:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387371520] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:47:09,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:47:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-09-20 19:47:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43526015] [2024-09-20 19:47:09,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:47:09,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-20 19:47:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:09,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-20 19:47:09,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-20 19:47:09,697 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-20 19:47:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:09,988 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2024-09-20 19:47:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-20 19:47:09,989 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-20 19:47:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:09,990 INFO L225 Difference]: With dead ends: 99 [2024-09-20 19:47:09,991 INFO L226 Difference]: Without dead ends: 67 [2024-09-20 19:47:09,991 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-20 19:47:09,992 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:47:09,992 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 498 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 19:47:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-20 19:47:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2024-09-20 19:47:10,006 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-20 19:47:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2024-09-20 19:47:10,007 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 68 [2024-09-20 19:47:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:10,007 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2024-09-20 19:47:10,007 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-20 19:47:10,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2024-09-20 19:47:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-20 19:47:10,008 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:10,009 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-20 19:47:10,025 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-20 19:47:10,213 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-20 19:47:10,214 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:10,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash -640732844, now seen corresponding path program 2 times [2024-09-20 19:47:10,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:10,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358903632] [2024-09-20 19:47:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:10,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 19:47:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-20 19:47:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:10,600 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-20 19:47:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358903632] [2024-09-20 19:47:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358903632] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:47:10,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134957631] [2024-09-20 19:47:10,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:47:10,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:47:10,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:10,603 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-20 19:47:10,605 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-20 19:47:10,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:47:10,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:47:10,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-20 19:47:10,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:47:10,840 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-20 19:47:10,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:47:11,729 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-20 19:47:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134957631] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:47:11,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:47:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 22 [2024-09-20 19:47:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80438860] [2024-09-20 19:47:11,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:47:11,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-20 19:47:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-20 19:47:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2024-09-20 19:47:11,733 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-20 19:47:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:12,167 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2024-09-20 19:47:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-20 19:47:12,168 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-20 19:47:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:12,169 INFO L225 Difference]: With dead ends: 157 [2024-09-20 19:47:12,170 INFO L226 Difference]: Without dead ends: 101 [2024-09-20 19:47:12,170 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-20 19:47:12,171 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-20 19:47:12,171 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-20 19:47:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-20 19:47:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-09-20 19:47:12,184 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-20 19:47:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2024-09-20 19:47:12,185 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 77 [2024-09-20 19:47:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:12,186 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2024-09-20 19:47:12,186 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-20 19:47:12,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2024-09-20 19:47:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-20 19:47:12,187 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:12,188 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-20 19:47:12,204 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-20 19:47:12,391 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-20 19:47:12,392 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:12,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1768804806, now seen corresponding path program 1 times [2024-09-20 19:47:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:12,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948492998] [2024-09-20 19:47:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,514 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:47:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-20 19:47:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,534 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-20 19:47:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,538 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,540 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-20 19:47:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:12,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948492998] [2024-09-20 19:47:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948492998] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:47:12,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:47:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 19:47:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738259826] [2024-09-20 19:47:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:47:12,542 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 19:47:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:12,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 19:47:12,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 19:47:12,543 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-20 19:47:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:12,594 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2024-09-20 19:47:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 19:47:12,595 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-20 19:47:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:12,596 INFO L225 Difference]: With dead ends: 185 [2024-09-20 19:47:12,597 INFO L226 Difference]: Without dead ends: 97 [2024-09-20 19:47:12,598 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-20 19:47:12,598 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-20 19:47:12,598 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-20 19:47:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-20 19:47:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-20 19:47:12,614 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-20 19:47:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-09-20 19:47:12,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 84 [2024-09-20 19:47:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:12,616 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-09-20 19:47:12,616 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-20 19:47:12,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-09-20 19:47:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-20 19:47:12,620 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:47:12,620 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-20 19:47:12,620 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-20 19:47:12,621 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:47:12,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -802082800, now seen corresponding path program 2 times [2024-09-20 19:47:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:47:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935859269] [2024-09-20 19:47:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:47:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:47:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:47:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 19:47:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 19:47:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,917 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 19:47:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:12,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:47:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:13,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-20 19:47:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:13,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-20 19:47:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:13,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-20 19:47:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:47:13,023 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-20 19:47:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:47:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935859269] [2024-09-20 19:47:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935859269] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 19:47:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348110113] [2024-09-20 19:47:13,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 19:47:13,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 19:47:13,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:47:13,025 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-20 19:47:13,027 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-20 19:47:13,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 19:47:13,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 19:47:13,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-20 19:47:13,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:47:13,330 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-20 19:47:13,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:47:15,217 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-20 19:47:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348110113] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 19:47:15,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 19:47:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 25 [2024-09-20 19:47:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899771531] [2024-09-20 19:47:15,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 19:47:15,218 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-20 19:47:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:47:15,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-20 19:47:15,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-20 19:47:15,219 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-20 19:47:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:47:15,468 INFO L93 Difference]: Finished difference Result 158 states and 212 transitions. [2024-09-20 19:47:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 19:47:15,469 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-20 19:47:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:47:15,470 INFO L225 Difference]: With dead ends: 158 [2024-09-20 19:47:15,470 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 19:47:15,471 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-20 19:47:15,471 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.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:47:15,471 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.2s Time] [2024-09-20 19:47:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 19:47:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 19:47:15,472 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-20 19:47:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 19:47:15,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-09-20 19:47:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:47:15,473 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 19:47:15,473 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-20 19:47:15,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:47:15,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 19:47:15,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 19:47:15,476 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:47:15,492 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-20 19:47:15,677 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-20 19:47:15,679 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:47:15,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-20 19:47:17,200 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:47:17,222 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-20 19:47:17,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:47:17 BoogieIcfgContainer [2024-09-20 19:47:17,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:47:17,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:47:17,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:47:17,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:47:17,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:47:04" (3/4) ... [2024-09-20 19:47:17,226 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-20 19:47:17,270 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-20 19:47:17,270 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:47:17,271 INFO L158 Benchmark]: Toolchain (without parser) took 13902.16ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 121.7MB in the beginning and 166.6MB in the end (delta: -44.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-09-20 19:47:17,271 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 104.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:47:17,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.39ms. Allocated memory is still 161.5MB. Free memory was 121.7MB in the beginning and 109.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 19:47:17,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.36ms. Allocated memory is still 161.5MB. Free memory was 109.2MB in the beginning and 108.4MB in the end (delta: 741.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:47:17,271 INFO L158 Benchmark]: Boogie Preprocessor took 37.92ms. Allocated memory is still 161.5MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:47:17,272 INFO L158 Benchmark]: RCFGBuilder took 426.60ms. Allocated memory is still 161.5MB. Free memory was 106.3MB in the beginning and 123.1MB in the end (delta: -16.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:47:17,272 INFO L158 Benchmark]: TraceAbstraction took 13072.93ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 122.6MB in the beginning and 169.7MB in the end (delta: -47.1MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. [2024-09-20 19:47:17,272 INFO L158 Benchmark]: Witness Printer took 46.14ms. Allocated memory is still 234.9MB. Free memory was 169.7MB in the beginning and 166.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:47:17,274 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.19ms. Allocated memory is still 104.9MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.39ms. Allocated memory is still 161.5MB. Free memory was 121.7MB in the beginning and 109.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.36ms. Allocated memory is still 161.5MB. Free memory was 109.2MB in the beginning and 108.4MB in the end (delta: 741.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.92ms. Allocated memory is still 161.5MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.60ms. Allocated memory is still 161.5MB. Free memory was 106.3MB in the beginning and 123.1MB in the end (delta: -16.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13072.93ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 122.6MB in the beginning and 169.7MB in the end (delta: -47.1MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. * Witness Printer took 46.14ms. Allocated memory is still 234.9MB. Free memory was 169.7MB in the beginning and 166.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, 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.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3584 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1777 IncrementalHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 732 mSDtfsCounter, 1777 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.2s 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) \old(m) * 2) < ((long long) \old(n) + 1)) || (\old(n) == \old(m))) || (\old(n) == 0)) || (((long long) \old(n) + \old(m)) < 1)) || (\old(m) < 1)) - ProcedureContractResult [Line: 17]: Procedure Contract for mult Derived contract for procedure mult. Ensures: ((((2 < \result) || (\result == 0)) || (\old(m) < 2)) || (\old(n) < 2)) - ProcedureContractResult [Line: 52]: Procedure Contract for is_prime Derived contract for procedure is_prime. Ensures: ((\old(n) < 3) || (\result == 0)) RESULT: Ultimate proved your program to be correct! [2024-09-20 19:47:17,305 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