./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/linear_sea.ch.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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/linear_sea.ch.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 eb9784c54ab470258ada67babaf5f63148f3484f17edd94b8d28d55553534fa5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 17:50:16,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:50:16,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:50:16,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:50:16,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:50:16,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:50:16,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:50:16,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:50:16,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:50:16,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:50:16,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:50:16,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:50:16,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:50:16,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:50:16,980 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:50:16,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:50:16,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:50:16,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:50:16,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:50:16,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:50:16,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:50:16,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:50:16,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:50:16,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:50:16,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:50:16,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:50:16,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:50:16,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:50:16,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:50:16,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:50:16,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:50:16,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:50:16,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:50:16,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:50:16,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:50:17,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:50:17,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:50:17,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:50:17,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:50:17,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:50:17,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:50:17,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:50:17,002 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 -> eb9784c54ab470258ada67babaf5f63148f3484f17edd94b8d28d55553534fa5 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.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 17:50:17,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:50:17,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:50:17,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:50:17,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:50:17,374 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:50:17,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/linear_sea.ch.c [2024-09-12 17:50:18,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:50:19,111 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:50:19,112 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/linear_sea.ch.c [2024-09-12 17:50:19,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/886c51c68/8b21bec0887d4afba1a358dc3fef743a/FLAG738b3c69b [2024-09-12 17:50:19,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/886c51c68/8b21bec0887d4afba1a358dc3fef743a [2024-09-12 17:50:19,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:50:19,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:50:19,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:50:19,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:50:19,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:50:19,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492a760d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19, skipping insertion in model container [2024-09-12 17:50:19,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:50:19,337 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/linear_sea.ch.c[383,396] [2024-09-12 17:50:19,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:50:19,373 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:50:19,384 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/linear_sea.ch.c[383,396] [2024-09-12 17:50:19,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:50:19,411 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:50:19,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19 WrapperNode [2024-09-12 17:50:19,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:50:19,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:50:19,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:50:19,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:50:19,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,433 INFO L138 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:50:19,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:50:19,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:50:19,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:50:19,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:50:19,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,468 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-09-12 17:50:19,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:50:19,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:50:19,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:50:19,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:50:19,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (1/1) ... [2024-09-12 17:50:19,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:50:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:19,594 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-12 17:50:19,600 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-12 17:50:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:50:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2024-09-12 17:50:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2024-09-12 17:50:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:50:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:50:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:50:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 17:50:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 17:50:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 17:50:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:50:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:50:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 17:50:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:50:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:50:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 17:50:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 17:50:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 17:50:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 17:50:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 17:50:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 17:50:19,722 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:50:19,725 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:50:19,946 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-12 17:50:19,947 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:50:19,971 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:50:19,974 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 17:50:19,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:50:19 BoogieIcfgContainer [2024-09-12 17:50:19,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:50:19,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:50:19,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:50:19,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:50:19,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:50:19" (1/3) ... [2024-09-12 17:50:19,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e434e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:50:19, skipping insertion in model container [2024-09-12 17:50:19,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:19" (2/3) ... [2024-09-12 17:50:19,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e434e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:50:19, skipping insertion in model container [2024-09-12 17:50:19,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:50:19" (3/3) ... [2024-09-12 17:50:19,985 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2024-09-12 17:50:19,999 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:50:20,000 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 17:50:20,061 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:50:20,068 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;@2be3bd44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:50:20,069 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 17:50:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 17:50:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:50:20,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:20,082 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-12 17:50:20,082 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:50:20,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 430877326, now seen corresponding path program 1 times [2024-09-12 17:50:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934450820] [2024-09-12 17:50:20,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:50:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:50:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,405 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-12 17:50:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934450820] [2024-09-12 17:50:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934450820] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:20,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:50:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759398735] [2024-09-12 17:50:20,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:20,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:20,440 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 17:50:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:20,599 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-09-12 17:50:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:50:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-12 17:50:20,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:20,608 INFO L225 Difference]: With dead ends: 49 [2024-09-12 17:50:20,608 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 17:50:20,611 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:20,616 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:20,618 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 21 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 17:50:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-12 17:50:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-12 17:50:20,668 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2024-09-12 17:50:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:20,668 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-12 17:50:20,669 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 17:50:20,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-12 17:50:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 17:50:20,670 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:20,671 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] [2024-09-12 17:50:20,671 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:50:20,671 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:50:20,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1655871353, now seen corresponding path program 1 times [2024-09-12 17:50:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569142345] [2024-09-12 17:50:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:50:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:50:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,014 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-12 17:50:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569142345] [2024-09-12 17:50:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569142345] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 17:50:21,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814118861] [2024-09-12 17:50:21,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:21,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:50:21,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:21,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:50:21,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:50:21,019 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 17:50:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:21,240 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-09-12 17:50:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 17:50:21,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-12 17:50:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:21,242 INFO L225 Difference]: With dead ends: 32 [2024-09-12 17:50:21,243 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 17:50:21,243 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:50:21,245 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:21,246 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 35 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 17:50:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-12 17:50:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-12 17:50:21,260 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2024-09-12 17:50:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:21,260 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-12 17:50:21,260 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 17:50:21,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-12 17:50:21,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 17:50:21,261 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:21,261 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] [2024-09-12 17:50:21,262 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:50:21,262 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:50:21,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 86938982, now seen corresponding path program 1 times [2024-09-12 17:50:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:21,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354223868] [2024-09-12 17:50:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:50:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:50:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,341 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-12 17:50:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354223868] [2024-09-12 17:50:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354223868] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-12 17:50:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191071084] [2024-09-12 17:50:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:22,344 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 17:50:22,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 17:50:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:50:22,345 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:22,684 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-09-12 17:50:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 17:50:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-09-12 17:50:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:22,686 INFO L225 Difference]: With dead ends: 36 [2024-09-12 17:50:22,686 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 17:50:22,686 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-09-12 17:50:22,687 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:22,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 25 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:50:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 17:50:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-12 17:50:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-12 17:50:22,703 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2024-09-12 17:50:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:22,704 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-12 17:50:22,704 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:22,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-12 17:50:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 17:50:22,706 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:22,706 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:22,706 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:50:22,707 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:50:22,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2127576749, now seen corresponding path program 1 times [2024-09-12 17:50:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458533240] [2024-09-12 17:50:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:50:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:50:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:22,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:22,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458533240] [2024-09-12 17:50:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458533240] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966577307] [2024-09-12 17:50:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:22,979 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-12 17:50:22,981 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-12 17:50:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-12 17:50:23,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:23,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-12 17:50:23,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2024-09-12 17:50:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:23,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966577307] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:24,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 8] total 26 [2024-09-12 17:50:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025810739] [2024-09-12 17:50:24,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:24,883 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 17:50:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 17:50:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2024-09-12 17:50:24,886 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 26 states, 24 states have (on average 1.75) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 17:50:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:27,303 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-09-12 17:50:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-12 17:50:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.75) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 26 [2024-09-12 17:50:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:27,305 INFO L225 Difference]: With dead ends: 59 [2024-09-12 17:50:27,305 INFO L226 Difference]: Without dead ends: 40 [2024-09-12 17:50:27,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=538, Invalid=1912, Unknown=0, NotChecked=0, Total=2450 [2024-09-12 17:50:27,307 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 198 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:27,308 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 38 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 17:50:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-12 17:50:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-09-12 17:50:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:27,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-09-12 17:50:27,332 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2024-09-12 17:50:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:27,333 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-09-12 17:50:27,333 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.75) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-12 17:50:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-09-12 17:50:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 17:50:27,334 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:27,334 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:27,352 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 17:50:27,538 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:27,539 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:50:27,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:27,539 INFO L85 PathProgramCache]: Analyzing trace with hash -166112124, now seen corresponding path program 1 times [2024-09-12 17:50:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:27,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085506307] [2024-09-12 17:50:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:28,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:28,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:50:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:28,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:50:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085506307] [2024-09-12 17:50:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085506307] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:28,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505789912] [2024-09-12 17:50:28,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:28,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:28,832 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-12 17:50:28,847 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-12 17:50:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:28,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-12 17:50:28,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:28,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2024-09-12 17:50:28,979 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-12 17:50:28,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-09-12 17:50:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:29,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:32,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-09-12 17:50:32,203 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-09-12 17:50:32,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 1 [2024-09-12 17:50:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505789912] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:32,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 13] total 39 [2024-09-12 17:50:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546191346] [2024-09-12 17:50:32,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:32,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-12 17:50:32,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-12 17:50:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2024-09-12 17:50:32,216 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-12 17:50:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:53,820 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-09-12 17:50:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-09-12 17:50:53,821 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 29 [2024-09-12 17:50:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:53,822 INFO L225 Difference]: With dead ends: 78 [2024-09-12 17:50:53,822 INFO L226 Difference]: Without dead ends: 62 [2024-09-12 17:50:53,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=1116, Invalid=5200, Unknown=4, NotChecked=0, Total=6320 [2024-09-12 17:50:53,825 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 174 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:53,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 75 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 17:50:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-12 17:50:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2024-09-12 17:50:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-09-12 17:50:53,877 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2024-09-12 17:50:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:53,877 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-09-12 17:50:53,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 36 states have internal predecessors, (52), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-12 17:50:53,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-09-12 17:50:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 17:50:53,878 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:53,878 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:53,896 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 17:50:54,079 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:54,080 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:50:54,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1383275185, now seen corresponding path program 2 times [2024-09-12 17:50:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192425594] [2024-09-12 17:50:54,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:54,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:54,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:50:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:54,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:50:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:55,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:55,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192425594] [2024-09-12 17:50:55,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192425594] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:55,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559561700] [2024-09-12 17:50:55,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:50:55,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:55,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:55,791 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-12 17:50:55,792 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-12 17:50:55,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:50:55,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:50:55,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-12 17:50:55,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:55,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2024-09-12 17:50:55,935 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-12 17:50:55,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-09-12 17:50:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:56,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:57,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-09-12 17:50:57,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:57,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 119 [2024-09-12 17:50:57,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:57,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 28 [2024-09-12 17:50:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:57,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559561700] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:57,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:57,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2024-09-12 17:50:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284293845] [2024-09-12 17:50:57,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:57,415 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-12 17:50:57,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-12 17:50:57,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 17:50:57,417 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 36 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 9 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-12 17:51:16,425 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 56 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 17:51:42,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:51:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:51:42,364 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2024-09-12 17:51:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-12 17:51:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 9 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 32 [2024-09-12 17:51:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:51:42,366 INFO L225 Difference]: With dead ends: 92 [2024-09-12 17:51:42,366 INFO L226 Difference]: Without dead ends: 51 [2024-09-12 17:51:42,367 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=685, Invalid=3466, Unknown=9, NotChecked=0, Total=4160 [2024-09-12 17:51:42,368 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 193 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-09-12 17:51:42,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 40 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 480 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-09-12 17:51:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-12 17:51:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-09-12 17:51:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:51:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-09-12 17:51:42,401 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 32 [2024-09-12 17:51:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:51:42,402 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-09-12 17:51:42,402 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.9375) internal successors, (62), 33 states have internal predecessors, (62), 9 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-12 17:51:42,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:51:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-09-12 17:51:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 17:51:42,403 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:51:42,403 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:51:42,416 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 17:51:42,603 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 17:51:42,604 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:51:42,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:51:42,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1560094502, now seen corresponding path program 2 times [2024-09-12 17:51:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:51:42,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222797151] [2024-09-12 17:51:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:51:42,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:51:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:42,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:51:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:42,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:51:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:42,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:51:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-12 17:51:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:51:42,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222797151] [2024-09-12 17:51:42,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222797151] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:51:42,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283201029] [2024-09-12 17:51:42,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:51:42,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:51:42,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:51:42,975 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-12 17:51:42,976 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-12 17:51:43,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:51:43,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:51:43,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 17:51:43,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:51:43,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-12 17:51:43,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2024-09-12 17:51:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-12 17:51:44,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:51:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-12 17:51:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283201029] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:51:45,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:51:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 7] total 25 [2024-09-12 17:51:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774866502] [2024-09-12 17:51:45,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:51:45,123 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 17:51:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:51:45,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 17:51:45,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-09-12 17:51:45,124 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 21 states have internal predecessors, (46), 6 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 17:51:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:51:46,050 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-09-12 17:51:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 17:51:46,050 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 21 states have internal predecessors, (46), 6 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 35 [2024-09-12 17:51:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:51:46,051 INFO L225 Difference]: With dead ends: 56 [2024-09-12 17:51:46,051 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 17:51:46,052 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 17:51:46,053 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 17:51:46,053 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 40 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 17:51:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 17:51:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2024-09-12 17:51:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:51:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-12 17:51:46,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 35 [2024-09-12 17:51:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:51:46,079 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-12 17:51:46,079 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 21 states have internal predecessors, (46), 6 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 17:51:46,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:51:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-12 17:51:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 17:51:46,080 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:51:46,080 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:51:46,093 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-12 17:51:46,281 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:51:46,281 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:51:46,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:51:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1167067492, now seen corresponding path program 3 times [2024-09-12 17:51:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:51:46,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78384047] [2024-09-12 17:51:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:51:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:51:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:46,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:51:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:46,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 17:51:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:46,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 17:51:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:51:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:51:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:51:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78384047] [2024-09-12 17:51:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78384047] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:51:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153951070] [2024-09-12 17:51:49,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:51:49,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:51:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:51:49,599 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-12 17:51:49,602 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-12 17:51:49,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-12 17:51:49,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:51:49,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-12 17:51:49,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:51:49,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2024-09-12 17:51:49,912 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-12 17:51:49,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-09-12 17:51:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:51:52,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:52:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2024-09-12 17:52:12,394 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-09-12 17:52:12,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 1 [2024-09-12 17:52:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:52:12,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153951070] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:52:12,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:52:12,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 17] total 54 [2024-09-12 17:52:12,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535110306] [2024-09-12 17:52:12,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:52:12,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-12 17:52:12,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:52:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-12 17:52:12,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2625, Unknown=1, NotChecked=0, Total=2862 [2024-09-12 17:52:12,407 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 54 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 9 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-12 17:52:44,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:53:44,426 WARN L293 SmtUtils]: Spent 48.99s on a formula simplification. DAG size of input: 217 DAG size of output: 183 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)