./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 11:56:36,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 11:56:36,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 11:56:36,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 11:56:36,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 11:56:36,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 11:56:36,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 11:56:36,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 11:56:36,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 11:56:36,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 11:56:36,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 11:56:36,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 11:56:36,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 11:56:36,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 11:56:36,605 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 11:56:36,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 11:56:36,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 11:56:36,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 11:56:36,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 11:56:36,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 11:56:36,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 11:56:36,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 11:56:36,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 11:56:36,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 11:56:36,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 11:56:36,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 11:56:36,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 11:56:36,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 11:56:36,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 11:56:36,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 11:56:36,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 11:56:36,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 11:56:36,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 11:56:36,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 11:56:36,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 11:56:36,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 11:56:36,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 11:56:36,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 11:56:36,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 11:56:36,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 11:56:36,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 11:56:36,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 11:56:36,617 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.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 11:56:36,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 11:56:36,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 11:56:36,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 11:56:36,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 11:56:36,952 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 11:56:36,953 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-20 11:56:38,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 11:56:38,460 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 11:56:38,461 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/linear_sea.ch.c [2024-09-20 11:56:38,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c668f4adf/2dca42f91cac488ba5ef6c2e8f4e50bf/FLAG01f70adf3 [2024-09-20 11:56:38,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c668f4adf/2dca42f91cac488ba5ef6c2e8f4e50bf [2024-09-20 11:56:38,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 11:56:38,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 11:56:38,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 11:56:38,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 11:56:38,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 11:56:38,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:56:38" (1/1) ... [2024-09-20 11:56:38,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cda580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:38, skipping insertion in model container [2024-09-20 11:56:38,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:56:38" (1/1) ... [2024-09-20 11:56:38,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 11:56:39,035 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/linear_sea.ch.c[383,396] [2024-09-20 11:56:39,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 11:56:39,080 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 11:56:39,092 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/linear_sea.ch.c[383,396] [2024-09-20 11:56:39,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 11:56:39,123 INFO L204 MainTranslator]: Completed translation [2024-09-20 11:56:39,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39 WrapperNode [2024-09-20 11:56:39,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 11:56:39,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 11:56:39,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 11:56:39,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 11:56:39,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,146 INFO L138 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 11:56:39,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 11:56:39,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 11:56:39,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 11:56:39,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 11:56:39,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,179 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-20 11:56:39,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 11:56:39,194 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 11:56:39,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 11:56:39,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 11:56:39,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (1/1) ... [2024-09-20 11:56:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 11:56:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:56:39,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 11:56:39,228 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 11:56:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 11:56:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2024-09-20 11:56:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2024-09-20 11:56:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 11:56:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 11:56:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 11:56:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 11:56:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 11:56:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 11:56:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 11:56:39,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 11:56:39,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-20 11:56:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 11:56:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 11:56:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 11:56:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 11:56:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-20 11:56:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-20 11:56:39,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 11:56:39,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 11:56:39,349 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 11:56:39,351 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 11:56:39,540 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-20 11:56:39,540 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 11:56:39,562 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 11:56:39,563 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 11:56:39,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:56:39 BoogieIcfgContainer [2024-09-20 11:56:39,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 11:56:39,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 11:56:39,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 11:56:39,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 11:56:39,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:56:38" (1/3) ... [2024-09-20 11:56:39,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9079fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:56:39, skipping insertion in model container [2024-09-20 11:56:39,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:56:39" (2/3) ... [2024-09-20 11:56:39,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9079fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:56:39, skipping insertion in model container [2024-09-20 11:56:39,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:56:39" (3/3) ... [2024-09-20 11:56:39,575 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2024-09-20 11:56:39,612 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 11:56:39,616 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 11:56:39,694 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 11:56:39,700 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;@4cd6982b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 11:56:39,701 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 11:56:39,705 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-20 11:56:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 11:56:39,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:56:39,713 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:56:39,714 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:56:39,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 430877326, now seen corresponding path program 1 times [2024-09-20 11:56:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:56:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598111881] [2024-09-20 11:56:39,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:56:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:39,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:56:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:39,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:56:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:39,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:56:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:56:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:56:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598111881] [2024-09-20 11:56:40,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598111881] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:56:40,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:56:40,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 11:56:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417492256] [2024-09-20 11:56:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:56:40,016 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 11:56:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:56:40,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 11:56:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 11:56:40,044 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-20 11:56:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:56:40,178 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2024-09-20 11:56:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 11:56:40,182 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-20 11:56:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:56:40,188 INFO L225 Difference]: With dead ends: 49 [2024-09-20 11:56:40,188 INFO L226 Difference]: Without dead ends: 24 [2024-09-20 11:56:40,190 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-20 11:56:40,193 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-20 11:56:40,193 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-20 11:56:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-20 11:56:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-20 11:56:40,223 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-20 11:56:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-20 11:56:40,225 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2024-09-20 11:56:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:56:40,226 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-20 11:56:40,226 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-20 11:56:40,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-20 11:56:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 11:56:40,228 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:56:40,228 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-20 11:56:40,228 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 11:56:40,228 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:56:40,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1655871353, now seen corresponding path program 1 times [2024-09-20 11:56:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:56:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695365630] [2024-09-20 11:56:40,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:56:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:40,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:56:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:40,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:56:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:40,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:56:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:56:40,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:56:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695365630] [2024-09-20 11:56:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695365630] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:56:40,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:56:40,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 11:56:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352580381] [2024-09-20 11:56:40,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:56:40,595 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 11:56:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:56:40,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 11:56:40,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 11:56:40,598 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-20 11:56:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:56:40,792 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-09-20 11:56:40,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-20 11:56:40,793 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-20 11:56:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:56:40,794 INFO L225 Difference]: With dead ends: 32 [2024-09-20 11:56:40,794 INFO L226 Difference]: Without dead ends: 24 [2024-09-20 11:56:40,795 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-20 11:56:40,796 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-20 11:56:40,797 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-20 11:56:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-20 11:56:40,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-20 11:56:40,803 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-20 11:56:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-20 11:56:40,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2024-09-20 11:56:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:56:40,805 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-20 11:56:40,805 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-20 11:56:40,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-20 11:56:40,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 11:56:40,807 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:56:40,807 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-20 11:56:40,807 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 11:56:40,807 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:56:40,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 86938982, now seen corresponding path program 1 times [2024-09-20 11:56:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:56:40,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736032062] [2024-09-20 11:56:40,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:40,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:56:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:41,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:56:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:41,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:56:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:41,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:56:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:56:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:56:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736032062] [2024-09-20 11:56:41,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736032062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:56:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:56:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-20 11:56:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840984222] [2024-09-20 11:56:41,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:56:41,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 11:56:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:56:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 11:56:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-20 11:56:41,852 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-20 11:56:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:56:42,186 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-09-20 11:56:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 11:56:42,187 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-20 11:56:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:56:42,188 INFO L225 Difference]: With dead ends: 36 [2024-09-20 11:56:42,188 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 11:56:42,189 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-20 11:56:42,190 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-20 11:56:42,192 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-20 11:56:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 11:56:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 11:56:42,212 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-20 11:56:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-20 11:56:42,213 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2024-09-20 11:56:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:56:42,214 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-20 11:56:42,214 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-20 11:56:42,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-20 11:56:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 11:56:42,217 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:56:42,217 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-20 11:56:42,217 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 11:56:42,218 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:56:42,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2127576749, now seen corresponding path program 1 times [2024-09-20 11:56:42,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:56:42,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046023943] [2024-09-20 11:56:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:42,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:56:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:42,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:56:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:42,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:56:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:42,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:56:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:42,532 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-20 11:56:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:56:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046023943] [2024-09-20 11:56:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046023943] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:56:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92457526] [2024-09-20 11:56:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:42,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:56:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:56:42,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:56:42,539 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 11:56:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:42,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-20 11:56:42,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:56:42,687 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-20 11:56:42,753 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-20 11:56:43,315 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-20 11:56:43,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:56:44,302 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-20 11:56:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92457526] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:56:44,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:56:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 8] total 26 [2024-09-20 11:56:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340173772] [2024-09-20 11:56:44,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:56:44,306 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-20 11:56:44,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:56:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-20 11:56:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2024-09-20 11:56:44,309 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-20 11:56:46,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:56:46,773 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-09-20 11:56:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-20 11:56:46,774 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-20 11:56:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:56:46,775 INFO L225 Difference]: With dead ends: 59 [2024-09-20 11:56:46,775 INFO L226 Difference]: Without dead ends: 40 [2024-09-20 11:56:46,776 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-20 11:56:46,777 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-20 11:56:46,777 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-20 11:56:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-20 11:56:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-09-20 11:56:46,799 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-20 11:56:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-09-20 11:56:46,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2024-09-20 11:56:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:56:46,803 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-09-20 11:56:46,803 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-20 11:56:46,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-09-20 11:56:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-20 11:56:46,804 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:56:46,804 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-20 11:56:46,823 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-20 11:56:47,005 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-20 11:56:47,006 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:56:47,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:56:47,006 INFO L85 PathProgramCache]: Analyzing trace with hash -166112124, now seen corresponding path program 1 times [2024-09-20 11:56:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:56:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906418118] [2024-09-20 11:56:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:56:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:47,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:56:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:47,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:56:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:47,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:56:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:48,245 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-20 11:56:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:56:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906418118] [2024-09-20 11:56:48,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906418118] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:56:48,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426886900] [2024-09-20 11:56:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:56:48,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:56:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:56:48,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:56:48,254 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 11:56:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:56:48,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-20 11:56:48,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:56:48,388 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-20 11:56:48,393 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-20 11:56:48,401 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-20 11:56:49,358 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-20 11:56:49,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:56:52,556 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-20 11:56:52,571 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-09-20 11:56:52,571 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-20 11:56:52,579 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-20 11:56:52,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426886900] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:56:52,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:56:52,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 13] total 39 [2024-09-20 11:56:52,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147392618] [2024-09-20 11:56:52,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:56:52,582 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-20 11:56:52,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:56:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-20 11:56:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2024-09-20 11:56:52,585 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-20 11:57:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:07,054 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2024-09-20 11:57:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-09-20 11:57:07,055 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-20 11:57:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:07,056 INFO L225 Difference]: With dead ends: 78 [2024-09-20 11:57:07,056 INFO L226 Difference]: Without dead ends: 62 [2024-09-20 11:57:07,059 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=1120, Invalid=5200, Unknown=0, NotChecked=0, Total=6320 [2024-09-20 11:57:07,060 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 174 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:07,060 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 75 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-20 11:57:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-20 11:57:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2024-09-20 11:57:07,102 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-20 11:57:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-09-20 11:57:07,103 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 29 [2024-09-20 11:57:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:07,103 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-09-20 11:57:07,103 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-20 11:57:07,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-09-20 11:57:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-20 11:57:07,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:07,105 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-20 11:57:07,123 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 11:57:07,305 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-20 11:57:07,306 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:07,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:07,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1383275185, now seen corresponding path program 2 times [2024-09-20 11:57:07,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:07,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056938116] [2024-09-20 11:57:07,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:07,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:07,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:08,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:57:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:08,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:57:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:08,603 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-20 11:57:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056938116] [2024-09-20 11:57:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056938116] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:57:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607561711] [2024-09-20 11:57:08,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 11:57:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:57:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:57:08,606 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:57:08,607 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 11:57:08,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 11:57:08,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 11:57:08,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-20 11:57:08,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:57:08,829 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-20 11:57:08,833 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-20 11:57:08,840 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-20 11:57:09,451 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-20 11:57:09,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:57:10,236 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-20 11:57:10,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 11:57:10,250 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-20 11:57:10,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 11:57:10,274 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-20 11:57:10,317 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-20 11:57:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607561711] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:57:10,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:57:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 35 [2024-09-20 11:57:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176215007] [2024-09-20 11:57:10,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:57:10,318 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-20 11:57:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-20 11:57:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2024-09-20 11:57:10,320 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 35 states, 31 states have (on average 2.0) internal successors, (62), 32 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-20 11:57:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:19,449 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2024-09-20 11:57:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-20 11:57:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 2.0) internal successors, (62), 32 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-20 11:57:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:19,451 INFO L225 Difference]: With dead ends: 87 [2024-09-20 11:57:19,451 INFO L226 Difference]: Without dead ends: 45 [2024-09-20 11:57:19,452 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=590, Invalid=2947, Unknown=3, NotChecked=0, Total=3540 [2024-09-20 11:57:19,453 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 157 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:19,453 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 55 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-20 11:57:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-20 11:57:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-20 11:57:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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-20 11:57:19,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-20 11:57:19,480 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2024-09-20 11:57:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:19,480 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-20 11:57:19,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 2.0) internal successors, (62), 32 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-20 11:57:19,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-20 11:57:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-20 11:57:19,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:19,483 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-20 11:57:19,498 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 11:57:19,684 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-20 11:57:19,684 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:19,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1560094502, now seen corresponding path program 2 times [2024-09-20 11:57:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512256343] [2024-09-20 11:57:19,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:19,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:19,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:19,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:57:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:19,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:57:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:20,024 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-20 11:57:20,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512256343] [2024-09-20 11:57:20,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512256343] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:57:20,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045339364] [2024-09-20 11:57:20,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 11:57:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:57:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:57:20,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:57:20,029 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-20 11:57:20,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-20 11:57:20,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 11:57:20,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-20 11:57:20,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:57:20,125 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-20 11:57:20,185 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-20 11:57:20,868 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-20 11:57:20,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:57:21,862 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-20 11:57:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045339364] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:57:21,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:57:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 7] total 25 [2024-09-20 11:57:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742515192] [2024-09-20 11:57:21,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:57:21,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-20 11:57:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-20 11:57:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-09-20 11:57:21,864 INFO L87 Difference]: Start difference. First operand 43 states and 47 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-20 11:57:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:57:22,683 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-09-20 11:57:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-20 11:57:22,684 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-20 11:57:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:57:22,684 INFO L225 Difference]: With dead ends: 52 [2024-09-20 11:57:22,684 INFO L226 Difference]: Without dead ends: 43 [2024-09-20 11:57:22,685 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=1322, Unknown=0, NotChecked=0, Total=1640 [2024-09-20 11:57:22,686 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 100 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-20 11:57:22,686 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 46 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-20 11:57:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-20 11:57:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-09-20 11:57:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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-20 11:57:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-09-20 11:57:22,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2024-09-20 11:57:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:57:22,722 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-09-20 11:57:22,722 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-20 11:57:22,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-09-20 11:57:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-20 11:57:22,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:57:22,725 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-20 11:57:22,741 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-20 11:57:22,925 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-20 11:57:22,926 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:57:22,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:57:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1167067492, now seen corresponding path program 3 times [2024-09-20 11:57:22,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:57:22,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649107050] [2024-09-20 11:57:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:57:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:57:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:23,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:57:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:23,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:57:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:23,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-20 11:57:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:57:30,385 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-20 11:57:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:57:30,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649107050] [2024-09-20 11:57:30,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649107050] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:57:30,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597923123] [2024-09-20 11:57:30,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 11:57:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:57:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:57:30,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:57:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 11:57:30,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-09-20 11:57:30,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 11:57:30,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-20 11:57:30,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:57:30,636 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-20 11:57:30,639 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-20 11:57:30,642 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-20 11:57:33,033 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-20 11:57:33,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:57:57,332 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-20 11:57:57,340 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2024-09-20 11:57:57,341 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-20 11:57:57,348 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-20 11:57:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597923123] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:57:57,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:57:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 17] total 54 [2024-09-20 11:57:57,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667888532] [2024-09-20 11:57:57,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:57:57,349 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-20 11:57:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:57:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-20 11:57:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=2624, Unknown=3, NotChecked=0, Total=2862 [2024-09-20 11:57:57,351 INFO L87 Difference]: Start difference. First operand 42 states and 45 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-20 11:58:19,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 11:59:51,049 WARN L293 SmtUtils]: Spent 1.47m on a formula simplification. DAG size of input: 229 DAG size of output: 198 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)