./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 03:36:01,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 03:36:01,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 03:36:01,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 03:36:01,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 03:36:01,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 03:36:01,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 03:36:01,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 03:36:01,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 03:36:01,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 03:36:01,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 03:36:01,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 03:36:01,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 03:36:01,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 03:36:01,152 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 03:36:01,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 03:36:01,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 03:36:01,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 03:36:01,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 03:36:01,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 03:36:01,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 03:36:01,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 03:36:01,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 03:36:01,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 03:36:01,157 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 03:36:01,157 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 03:36:01,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 03:36:01,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 03:36:01,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 03:36:01,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 03:36:01,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 03:36:01,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 03:36:01,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:36:01,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 03:36:01,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 03:36:01,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 03:36:01,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 03:36:01,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 03:36:01,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 03:36:01,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 03:36:01,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 03:36:01,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 03:36:01,162 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 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 [2024-09-13 03:36:01,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 03:36:01,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 03:36:01,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 03:36:01,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 03:36:01,426 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 03:36:01,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-13 03:36:02,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 03:36:03,062 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 03:36:03,063 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-13 03:36:03,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/866f12981/a2edc961e1444d169dbd305431e97f70/FLAG99df74e77 [2024-09-13 03:36:03,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/866f12981/a2edc961e1444d169dbd305431e97f70 [2024-09-13 03:36:03,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 03:36:03,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 03:36:03,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 03:36:03,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 03:36:03,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 03:36:03,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f4b8f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03, skipping insertion in model container [2024-09-13 03:36:03,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 03:36:03,259 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-13 03:36:03,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:36:03,289 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 03:36:03,300 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-13 03:36:03,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:36:03,342 INFO L204 MainTranslator]: Completed translation [2024-09-13 03:36:03,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03 WrapperNode [2024-09-13 03:36:03,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 03:36:03,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 03:36:03,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 03:36:03,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 03:36:03,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,372 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 03:36:03,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 03:36:03,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 03:36:03,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 03:36:03,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 03:36:03,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,400 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-13 03:36:03,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 03:36:03,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 03:36:03,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 03:36:03,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 03:36:03,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (1/1) ... [2024-09-13 03:36:03,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:36:03,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:36:03,450 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-13 03:36:03,453 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-13 03:36:03,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 03:36:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 03:36:03,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 03:36:03,509 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 03:36:03,510 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 03:36:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 03:36:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-13 03:36:03,510 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-13 03:36:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-13 03:36:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 03:36:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 03:36:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-13 03:36:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 03:36:03,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 03:36:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-13 03:36:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-13 03:36:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-13 03:36:03,513 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-13 03:36:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 03:36:03,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 03:36:03,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-13 03:36:03,609 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 03:36:03,611 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 03:36:03,797 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-13 03:36:03,797 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 03:36:03,819 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 03:36:03,820 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 03:36:03,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:36:03 BoogieIcfgContainer [2024-09-13 03:36:03,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 03:36:03,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 03:36:03,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 03:36:03,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 03:36:03,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 03:36:03" (1/3) ... [2024-09-13 03:36:03,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9191f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:36:03, skipping insertion in model container [2024-09-13 03:36:03,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:03" (2/3) ... [2024-09-13 03:36:03,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9191f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:36:03, skipping insertion in model container [2024-09-13 03:36:03,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:36:03" (3/3) ... [2024-09-13 03:36:03,831 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-13 03:36:03,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 03:36:03,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 03:36:03,906 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 03:36:03,913 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;@771883ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 03:36:03,913 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 03:36:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-13 03:36:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 03:36:03,926 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:03,927 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:03,928 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:03,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-13 03:36:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:36:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011817965] [2024-09-13 03:36:03,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:03,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:36:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:36:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:36:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 03:36:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:36:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:36:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:36:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011817965] [2024-09-13 03:36:04,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011817965] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:04,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:36:04,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 03:36:04,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474048447] [2024-09-13 03:36:04,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:04,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 03:36:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:36:04,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 03:36:04,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 03:36:04,238 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 03:36:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:04,370 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-13 03:36:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 03:36:04,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-13 03:36:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:04,382 INFO L225 Difference]: With dead ends: 78 [2024-09-13 03:36:04,382 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 03:36:04,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 03:36:04,394 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:04,395 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:36:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 03:36:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-13 03:36:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 03:36:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-13 03:36:04,489 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-13 03:36:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:04,489 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-13 03:36:04,490 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 03:36:04,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-13 03:36:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 03:36:04,500 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:04,500 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:04,500 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 03:36:04,501 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:04,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-13 03:36:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:36:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039566631] [2024-09-13 03:36:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:36:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:36:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:36:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 03:36:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:36:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:36:04,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:36:04,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039566631] [2024-09-13 03:36:04,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039566631] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:04,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:36:04,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 03:36:04,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286138238] [2024-09-13 03:36:04,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:04,885 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 03:36:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:36:04,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 03:36:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-13 03:36:04,887 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 03:36:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:05,202 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2024-09-13 03:36:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 03:36:05,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-13 03:36:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:05,205 INFO L225 Difference]: With dead ends: 62 [2024-09-13 03:36:05,206 INFO L226 Difference]: Without dead ends: 60 [2024-09-13 03:36:05,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-13 03:36:05,209 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:05,210 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:36:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-13 03:36:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2024-09-13 03:36:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 03:36:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-09-13 03:36:05,238 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 28 [2024-09-13 03:36:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:05,239 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-09-13 03:36:05,239 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 03:36:05,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-09-13 03:36:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 03:36:05,241 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:05,241 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:05,241 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 03:36:05,241 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:05,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-13 03:36:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:36:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261638922] [2024-09-13 03:36:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:05,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:36:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:05,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:36:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:05,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:36:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:05,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 03:36:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:05,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:36:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:05,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-13 03:36:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:36:05,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:36:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261638922] [2024-09-13 03:36:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261638922] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:36:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-13 03:36:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401110272] [2024-09-13 03:36:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:05,563 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 03:36:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:36:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 03:36:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-13 03:36:05,564 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 03:36:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:05,805 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-09-13 03:36:05,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 03:36:05,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2024-09-13 03:36:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:05,810 INFO L225 Difference]: With dead ends: 61 [2024-09-13 03:36:05,810 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 03:36:05,810 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-13 03:36:05,813 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:05,814 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:36:05,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 03:36:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 03:36:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-13 03:36:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-09-13 03:36:05,834 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2024-09-13 03:36:05,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:05,835 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-09-13 03:36:05,835 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 03:36:05,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-09-13 03:36:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 03:36:05,837 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:05,837 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:05,838 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 03:36:05,838 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:05,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1566356218, now seen corresponding path program 1 times [2024-09-13 03:36:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:36:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088185677] [2024-09-13 03:36:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:36:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:36:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:36:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 03:36:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:36:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,102 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 03:36:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-13 03:36:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 03:36:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:36:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088185677] [2024-09-13 03:36:06,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088185677] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:36:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344521751] [2024-09-13 03:36:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:06,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:36:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:36:06,123 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-13 03:36:06,126 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-13 03:36:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 03:36:06,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 03:36:06,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:36:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344521751] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:06,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 03:36:06,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-13 03:36:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070470807] [2024-09-13 03:36:06,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:06,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 03:36:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:36:06,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 03:36:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-13 03:36:06,389 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 03:36:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:06,601 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-09-13 03:36:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 03:36:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-09-13 03:36:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:06,603 INFO L225 Difference]: With dead ends: 68 [2024-09-13 03:36:06,603 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 03:36:06,603 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-13 03:36:06,604 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:06,604 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:36:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 03:36:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 40. [2024-09-13 03:36:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 03:36:06,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-13 03:36:06,616 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 43 [2024-09-13 03:36:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:06,617 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-13 03:36:06,617 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 03:36:06,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-13 03:36:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 03:36:06,620 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:06,621 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:06,639 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 03:36:06,821 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-13 03:36:06,822 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:06,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:06,822 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-13 03:36:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:36:06,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173255557] [2024-09-13 03:36:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:06,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:36:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:36:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:06,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:36:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 03:36:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:36:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 03:36:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-13 03:36:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-13 03:36:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 03:36:07,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:36:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173255557] [2024-09-13 03:36:07,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173255557] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:36:07,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847683444] [2024-09-13 03:36:07,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:07,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:36:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:36:07,053 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-13 03:36:07,055 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-13 03:36:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 03:36:07,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:07,158 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-13 03:36:07,301 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 29 treesize of output 23 [2024-09-13 03:36:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:36:07,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:36:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847683444] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:07,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 03:36:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-09-13 03:36:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343871770] [2024-09-13 03:36:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:07,334 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 03:36:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:36:07,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 03:36:07,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-13 03:36:07,335 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-13 03:36:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:07,446 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-09-13 03:36:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 03:36:07,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-09-13 03:36:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:07,449 INFO L225 Difference]: With dead ends: 72 [2024-09-13 03:36:07,449 INFO L226 Difference]: Without dead ends: 46 [2024-09-13 03:36:07,450 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-13 03:36:07,450 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:07,451 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:36:07,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-13 03:36:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-09-13 03:36:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 03:36:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-09-13 03:36:07,468 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 46 [2024-09-13 03:36:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:07,469 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-09-13 03:36:07,469 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-13 03:36:07,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-09-13 03:36:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 03:36:07,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:07,473 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:07,491 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 03:36:07,676 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-13 03:36:07,677 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:07,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:07,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1621189571, now seen corresponding path program 1 times [2024-09-13 03:36:07,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:36:07,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041984896] [2024-09-13 03:36:07,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:07,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:36:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:36:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:36:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 03:36:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:36:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 03:36:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-13 03:36:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-13 03:36:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 03:36:07,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:36:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041984896] [2024-09-13 03:36:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041984896] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:36:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642450013] [2024-09-13 03:36:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:07,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:36:07,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:36:07,889 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-13 03:36:07,890 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-13 03:36:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:07,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-13 03:36:07,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:08,027 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-13 03:36:08,271 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 29 treesize of output 23 [2024-09-13 03:36:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 03:36:08,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:36:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642450013] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:36:16,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:36:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 22 [2024-09-13 03:36:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183973143] [2024-09-13 03:36:16,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:36:16,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-13 03:36:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:36:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-13 03:36:16,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-09-13 03:36:16,477 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-13 03:36:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:17,045 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-09-13 03:36:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 03:36:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 46 [2024-09-13 03:36:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:17,046 INFO L225 Difference]: With dead ends: 46 [2024-09-13 03:36:17,046 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 03:36:17,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 03:36:17,048 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:17,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 03:36:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 03:36:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 03:36:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 03:36:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 03:36:17,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-09-13 03:36:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:17,050 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 03:36:17,051 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.588235294117647) internal successors, (44), 15 states have internal predecessors, (44), 7 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-13 03:36:17,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 03:36:17,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 03:36:17,054 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 03:36:17,071 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 03:36:17,255 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-13 03:36:17,258 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-13 03:36:17,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 03:36:18,609 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 03:36:18,623 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:126) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionToString(BacktranslationService.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:59) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-13 03:36:18,627 INFO L158 Benchmark]: Toolchain (without parser) took 15543.47ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 76.9MB in the beginning and 147.7MB in the end (delta: -70.8MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-09-13 03:36:18,627 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 03:36:18,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.17ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 119.3MB in the end (delta: -42.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-13 03:36:18,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.49ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 119.3MB in the beginning and 182.0MB in the end (delta: -62.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 03:36:18,628 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 209.7MB. Free memory was 182.0MB in the beginning and 179.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 03:36:18,628 INFO L158 Benchmark]: RCFGBuilder took 408.77ms. Allocated memory is still 209.7MB. Free memory was 179.9MB in the beginning and 163.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-13 03:36:18,629 INFO L158 Benchmark]: TraceAbstraction took 14802.92ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 163.1MB in the beginning and 147.7MB in the end (delta: 15.4MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. [2024-09-13 03:36:18,630 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory is still 101.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.17ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 119.3MB in the end (delta: -42.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.49ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 119.3MB in the beginning and 182.0MB in the end (delta: -62.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 209.7MB. Free memory was 182.0MB in the beginning and 179.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 408.77ms. Allocated memory is still 209.7MB. Free memory was 179.9MB in the beginning and 163.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14802.92ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 163.1MB in the beginning and 147.7MB in the end (delta: 15.4MB). Peak memory consumption was 131.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1307 IncrementalHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 124 mSDtfsCounter, 1307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=2, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 348 ConstructedInterpolants, 22 QuantifiedInterpolants, 1064 SizeOfPredicates, 21 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 93/110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-13 03:36:18,664 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/verifythis/elimination_max_rec_onepoint.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 03:36:20,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 03:36:21,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-13 03:36:21,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 03:36:21,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 03:36:21,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 03:36:21,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 03:36:21,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 03:36:21,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 03:36:21,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 03:36:21,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 03:36:21,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 03:36:21,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 03:36:21,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 03:36:21,070 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 03:36:21,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 03:36:21,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 03:36:21,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 03:36:21,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 03:36:21,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 03:36:21,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 03:36:21,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 03:36:21,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 03:36:21,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-13 03:36:21,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-13 03:36:21,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 03:36:21,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-13 03:36:21,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 03:36:21,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 03:36:21,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 03:36:21,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 03:36:21,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 03:36:21,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 03:36:21,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 03:36:21,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:36:21,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 03:36:21,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 03:36:21,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 03:36:21,081 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-13 03:36:21,081 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-13 03:36:21,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 03:36:21,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 03:36:21,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 03:36:21,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 03:36:21,083 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-13 03:36:21,084 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 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 [2024-09-13 03:36:21,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 03:36:21,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 03:36:21,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 03:36:21,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 03:36:21,460 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 03:36:21,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-13 03:36:23,071 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 03:36:23,303 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 03:36:23,303 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-09-13 03:36:23,315 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bc7a5c583/ec29478bc8a7417b8dd92137ca49fc52/FLAG1458c26b0 [2024-09-13 03:36:23,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bc7a5c583/ec29478bc8a7417b8dd92137ca49fc52 [2024-09-13 03:36:23,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 03:36:23,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 03:36:23,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 03:36:23,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 03:36:23,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 03:36:23,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ce3d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23, skipping insertion in model container [2024-09-13 03:36:23,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 03:36:23,536 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-13 03:36:23,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:36:23,585 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 03:36:23,598 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c[502,515] [2024-09-13 03:36:23,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:36:23,635 INFO L204 MainTranslator]: Completed translation [2024-09-13 03:36:23,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23 WrapperNode [2024-09-13 03:36:23,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 03:36:23,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 03:36:23,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 03:36:23,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 03:36:23,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,669 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 03:36:23,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 03:36:23,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 03:36:23,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 03:36:23,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 03:36:23,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,709 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-13 03:36:23,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 03:36:23,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 03:36:23,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 03:36:23,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 03:36:23,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (1/1) ... [2024-09-13 03:36:23,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:36:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:36:23,784 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-13 03:36:23,787 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-13 03:36:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 03:36:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-13 03:36:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-13 03:36:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 03:36:23,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 03:36:23,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 03:36:23,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 03:36:23,841 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-13 03:36:23,842 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-13 03:36:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 03:36:23,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 03:36:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-13 03:36:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-13 03:36:23,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-13 03:36:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 03:36:23,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 03:36:23,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-13 03:36:23,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-13 03:36:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 03:36:23,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 03:36:23,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-13 03:36:23,923 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 03:36:23,926 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 03:36:24,200 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-13 03:36:24,200 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 03:36:24,237 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 03:36:24,237 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 03:36:24,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:36:24 BoogieIcfgContainer [2024-09-13 03:36:24,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 03:36:24,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 03:36:24,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 03:36:24,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 03:36:24,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 03:36:23" (1/3) ... [2024-09-13 03:36:24,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1322075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:36:24, skipping insertion in model container [2024-09-13 03:36:24,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:36:23" (2/3) ... [2024-09-13 03:36:24,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1322075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:36:24, skipping insertion in model container [2024-09-13 03:36:24,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:36:24" (3/3) ... [2024-09-13 03:36:24,248 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-09-13 03:36:24,267 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 03:36:24,268 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 03:36:24,344 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 03:36:24,351 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;@2a2b2a3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 03:36:24,351 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 03:36:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-13 03:36:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 03:36:24,363 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:24,364 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:24,364 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:24,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1437097425, now seen corresponding path program 1 times [2024-09-13 03:36:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:36:24,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124763516] [2024-09-13 03:36:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:24,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:24,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:36:24,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:36:24,388 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-13 03:36:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:24,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-13 03:36:24,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 03:36:24,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:36:24,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:36:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124763516] [2024-09-13 03:36:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124763516] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:36:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 03:36:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175894800] [2024-09-13 03:36:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:24,529 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 03:36:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:36:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 03:36:24,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 03:36:24,555 INFO L87 Difference]: Start difference. First operand has 42 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 03:36:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:24,591 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-09-13 03:36:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 03:36:24,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-13 03:36:24,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:24,600 INFO L225 Difference]: With dead ends: 78 [2024-09-13 03:36:24,601 INFO L226 Difference]: Without dead ends: 38 [2024-09-13 03:36:24,604 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 03:36:24,607 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:24,608 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:36:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-13 03:36:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-13 03:36:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 03:36:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-09-13 03:36:24,652 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 28 [2024-09-13 03:36:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:24,653 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-09-13 03:36:24,653 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 03:36:24,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-09-13 03:36:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 03:36:24,656 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:24,656 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:24,660 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-13 03:36:24,860 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:24,861 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:24,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash 579935573, now seen corresponding path program 1 times [2024-09-13 03:36:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:36:24,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824604346] [2024-09-13 03:36:24,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:24,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:24,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:36:24,865 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:36:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-13 03:36:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:24,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-13 03:36:24,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:36:25,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:36:25,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:36:25,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824604346] [2024-09-13 03:36:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824604346] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:25,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:36:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-13 03:36:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907227081] [2024-09-13 03:36:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:25,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-13 03:36:25,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:36:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-13 03:36:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-13 03:36:25,361 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 03:36:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:25,788 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-09-13 03:36:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 03:36:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-13 03:36:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:25,791 INFO L225 Difference]: With dead ends: 56 [2024-09-13 03:36:25,791 INFO L226 Difference]: Without dead ends: 54 [2024-09-13 03:36:25,792 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-13 03:36:25,793 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:25,796 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 220 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 03:36:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-13 03:36:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-13 03:36:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-13 03:36:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-09-13 03:36:25,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 28 [2024-09-13 03:36:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:25,816 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-09-13 03:36:25,817 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 03:36:25,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-09-13 03:36:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 03:36:25,818 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:25,818 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:25,823 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-13 03:36:26,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:26,019 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:26,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2135763327, now seen corresponding path program 1 times [2024-09-13 03:36:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:36:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53383362] [2024-09-13 03:36:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:26,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:36:26,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:36:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-13 03:36:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:26,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 03:36:26,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:26,392 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-13 03:36:26,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-13 03:36:26,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 10 [2024-09-13 03:36:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:36:26,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:36:26,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:36:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53383362] [2024-09-13 03:36:26,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53383362] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:36:26,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:36:26,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-13 03:36:26,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793081732] [2024-09-13 03:36:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:36:26,491 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 03:36:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:36:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 03:36:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-09-13 03:36:26,492 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-13 03:36:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:26,883 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-13 03:36:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 03:36:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-09-13 03:36:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:26,886 INFO L225 Difference]: With dead ends: 66 [2024-09-13 03:36:26,887 INFO L226 Difference]: Without dead ends: 56 [2024-09-13 03:36:26,887 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-09-13 03:36:26,888 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:26,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 285 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 03:36:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-13 03:36:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-09-13 03:36:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-13 03:36:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-09-13 03:36:26,903 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2024-09-13 03:36:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:26,903 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-09-13 03:36:26,904 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-13 03:36:26,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-09-13 03:36:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-13 03:36:26,907 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:26,908 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:26,912 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-13 03:36:27,108 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:27,109 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:27,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 757009592, now seen corresponding path program 1 times [2024-09-13 03:36:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:36:27,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823969828] [2024-09-13 03:36:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:27,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:27,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:36:27,112 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:36:27,113 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-13 03:36:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:27,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-13 03:36:27,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:36:27,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:36:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 03:36:28,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:36:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823969828] [2024-09-13 03:36:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823969828] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:36:28,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:36:28,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2024-09-13 03:36:28,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714692221] [2024-09-13 03:36:28,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:36:28,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 03:36:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:36:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 03:36:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-09-13 03:36:28,418 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-13 03:36:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:36:30,343 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-13 03:36:30,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-13 03:36:30,344 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-13 03:36:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:36:30,346 INFO L225 Difference]: With dead ends: 108 [2024-09-13 03:36:30,346 INFO L226 Difference]: Without dead ends: 106 [2024-09-13 03:36:30,347 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 03:36:30,348 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-13 03:36:30,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 441 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-13 03:36:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-13 03:36:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 85. [2024-09-13 03:36:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-13 03:36:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2024-09-13 03:36:30,395 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 43 [2024-09-13 03:36:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:36:30,398 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2024-09-13 03:36:30,398 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 1.85) internal successors, (37), 19 states have internal predecessors, (37), 10 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-13 03:36:30,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2024-09-13 03:36:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 03:36:30,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:36:30,400 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:36:30,406 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-09-13 03:36:30,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:30,601 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:36:30,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:36:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -920124993, now seen corresponding path program 1 times [2024-09-13 03:36:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:36:30,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96844778] [2024-09-13 03:36:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:36:30,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:36:30,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:36:30,606 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:36:30,608 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-09-13 03:36:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:36:30,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-13 03:36:30,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:36:31,667 INFO L349 Elim1Store]: treesize reduction 80, result has 41.6 percent of original size [2024-09-13 03:36:31,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 71 [2024-09-13 03:36:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:36:31,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:36:41,181 INFO L349 Elim1Store]: treesize reduction 15, result has 59.5 percent of original size [2024-09-13 03:36:41,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 28 [2024-09-13 03:36:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:36:42,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:36:42,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96844778] [2024-09-13 03:36:42,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96844778] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:36:42,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:36:42,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2024-09-13 03:36:42,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347929246] [2024-09-13 03:36:42,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:36:42,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-13 03:36:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:36:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-13 03:36:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=952, Unknown=2, NotChecked=0, Total=1056 [2024-09-13 03:36:42,302 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-13 03:36:56,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:37:03,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:37:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:37:03,557 INFO L93 Difference]: Finished difference Result 165 states and 203 transitions. [2024-09-13 03:37:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-13 03:37:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 46 [2024-09-13 03:37:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:37:03,561 INFO L225 Difference]: With dead ends: 165 [2024-09-13 03:37:03,561 INFO L226 Difference]: Without dead ends: 163 [2024-09-13 03:37:03,562 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=257, Invalid=2496, Unknown=3, NotChecked=0, Total=2756 [2024-09-13 03:37:03,564 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 85 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:37:03,565 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 632 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 671 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2024-09-13 03:37:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-09-13 03:37:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2024-09-13 03:37:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 93 states have internal predecessors, (98), 40 states have call successors, (40), 18 states have call predecessors, (40), 20 states have return successors, (42), 34 states have call predecessors, (42), 37 states have call successors, (42) [2024-09-13 03:37:03,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-09-13 03:37:03,639 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 46 [2024-09-13 03:37:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:37:03,642 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-09-13 03:37:03,642 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 25 states have internal predecessors, (41), 11 states have call successors, (17), 6 states have call predecessors, (17), 4 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-13 03:37:03,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:37:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-09-13 03:37:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 03:37:03,645 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:37:03,645 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:37:03,654 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-09-13 03:37:03,848 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:37:03,848 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:37:03,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:37:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash 986908330, now seen corresponding path program 1 times [2024-09-13 03:37:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:37:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392475356] [2024-09-13 03:37:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:37:03,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:37:03,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:37:03,850 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:37:03,851 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-13 03:37:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:37:03,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 03:37:03,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:37:04,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-13 03:37:04,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 22 [2024-09-13 03:37:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-13 03:37:04,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:37:05,663 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-09-13 03:37:05,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-09-13 03:37:06,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:37:06,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392475356] [2024-09-13 03:37:06,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392475356] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:37:06,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1907403453] [2024-09-13 03:37:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:37:06,528 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 03:37:06,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 03:37:06,529 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-13 03:37:06,530 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-09-13 03:37:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:37:06,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 03:37:06,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:37:06,642 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-13 03:37:10,851 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_2))) is different from true [2024-09-13 03:38:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-09-13 03:38:24,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:38:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1907403453] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:38:53,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:38:53,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-09-13 03:38:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984981654] [2024-09-13 03:38:53,065 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:38:53,065 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 03:38:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:38:53,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 03:38:53,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=723, Unknown=18, NotChecked=54, Total=870 [2024-09-13 03:38:53,067 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 23 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2024-09-13 03:39:02,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:06,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:10,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:22,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:26,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:30,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:34,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:38,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:42,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:50,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:54,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:39:58,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:02,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:06,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:15,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:32,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:44,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:48,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:52,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:40:57,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:01,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:05,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:09,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:17,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:21,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:25,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:29,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:38,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:42,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:46,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:50,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:53,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:41:57,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:01,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:05,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:09,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:14,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:18,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:34,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:38,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:42,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:46,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:42:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:42:46,763 INFO L93 Difference]: Finished difference Result 222 states and 278 transitions. [2024-09-13 03:42:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-13 03:42:46,764 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) Word has length 55 [2024-09-13 03:42:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:42:46,767 INFO L225 Difference]: With dead ends: 222 [2024-09-13 03:42:46,767 INFO L226 Difference]: Without dead ends: 188 [2024-09-13 03:42:46,768 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 171.0s TimeCoverageRelationStatistics Valid=250, Invalid=2376, Unknown=30, NotChecked=100, Total=2756 [2024-09-13 03:42:46,769 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 37 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 25 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 169.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 169.7s IncrementalHoareTripleChecker+Time [2024-09-13 03:42:46,769 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 486 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 690 Invalid, 41 Unknown, 187 Unchecked, 169.7s Time] [2024-09-13 03:42:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-09-13 03:42:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 158. [2024-09-13 03:42:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 101 states have internal predecessors, (108), 43 states have call successors, (43), 21 states have call predecessors, (43), 21 states have return successors, (46), 35 states have call predecessors, (46), 39 states have call successors, (46) [2024-09-13 03:42:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 197 transitions. [2024-09-13 03:42:46,822 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 197 transitions. Word has length 55 [2024-09-13 03:42:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:42:46,822 INFO L474 AbstractCegarLoop]: Abstraction has 158 states and 197 transitions. [2024-09-13 03:42:46,823 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (15), 8 states have call predecessors, (15), 6 states have call successors, (15) [2024-09-13 03:42:46,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:42:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2024-09-13 03:42:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-13 03:42:46,824 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:42:46,825 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:42:46,831 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-13 03:42:47,028 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-09-13 03:42:47,225 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-13 03:42:47,226 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:42:47,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:42:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash 475561653, now seen corresponding path program 1 times [2024-09-13 03:42:47,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:42:47,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393446633] [2024-09-13 03:42:47,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:42:47,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:42:47,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:42:47,228 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:42:47,229 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-09-13 03:42:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:42:47,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-13 03:42:47,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:42:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-13 03:42:48,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:42:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 03:42:49,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:42:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393446633] [2024-09-13 03:42:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393446633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:42:49,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:42:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 27 [2024-09-13 03:42:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132296938] [2024-09-13 03:42:49,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:42:49,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 03:42:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:42:49,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 03:42:49,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2024-09-13 03:42:49,316 INFO L87 Difference]: Start difference. First operand 158 states and 197 transitions. Second operand has 27 states, 25 states have (on average 1.92) internal successors, (48), 21 states have internal predecessors, (48), 12 states have call successors, (23), 8 states have call predecessors, (23), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-13 03:42:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:42:54,445 INFO L93 Difference]: Finished difference Result 281 states and 363 transitions. [2024-09-13 03:42:54,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-13 03:42:54,447 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 21 states have internal predecessors, (48), 12 states have call successors, (23), 8 states have call predecessors, (23), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 58 [2024-09-13 03:42:54,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:42:54,450 INFO L225 Difference]: With dead ends: 281 [2024-09-13 03:42:54,450 INFO L226 Difference]: Without dead ends: 277 [2024-09-13 03:42:54,451 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=388, Invalid=1774, Unknown=0, NotChecked=0, Total=2162 [2024-09-13 03:42:54,451 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-09-13 03:42:54,452 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 812 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-09-13 03:42:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-09-13 03:42:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 228. [2024-09-13 03:42:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 135 states have (on average 1.162962962962963) internal successors, (157), 146 states have internal predecessors, (157), 63 states have call successors, (63), 30 states have call predecessors, (63), 29 states have return successors, (64), 51 states have call predecessors, (64), 59 states have call successors, (64) [2024-09-13 03:42:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 284 transitions. [2024-09-13 03:42:54,540 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 284 transitions. Word has length 58 [2024-09-13 03:42:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:42:54,540 INFO L474 AbstractCegarLoop]: Abstraction has 228 states and 284 transitions. [2024-09-13 03:42:54,540 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 21 states have internal predecessors, (48), 12 states have call successors, (23), 8 states have call predecessors, (23), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-13 03:42:54,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:42:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 284 transitions. [2024-09-13 03:42:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-13 03:42:54,542 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:42:54,542 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:42:54,547 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-09-13 03:42:54,743 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:42:54,743 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:42:54,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:42:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash -996409758, now seen corresponding path program 2 times [2024-09-13 03:42:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:42:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212457114] [2024-09-13 03:42:54,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:42:54,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:42:54,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:42:54,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:42:54,748 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-09-13 03:42:54,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:42:54,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:42:54,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-09-13 03:42:54,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:42:58,310 INFO L349 Elim1Store]: treesize reduction 156, result has 43.7 percent of original size [2024-09-13 03:42:58,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 143 [2024-09-13 03:42:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 03:42:58,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:43:09,656 INFO L349 Elim1Store]: treesize reduction 41, result has 36.9 percent of original size [2024-09-13 03:43:09,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 33 [2024-09-13 03:43:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 03:43:11,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:43:11,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212457114] [2024-09-13 03:43:11,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212457114] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:43:11,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:43:11,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 43 [2024-09-13 03:43:11,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768210514] [2024-09-13 03:43:11,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:43:11,274 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-13 03:43:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:43:11,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-13 03:43:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1637, Unknown=2, NotChecked=0, Total=1806 [2024-09-13 03:43:11,276 INFO L87 Difference]: Start difference. First operand 228 states and 284 transitions. Second operand has 43 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 31 states have internal predecessors, (55), 14 states have call successors, (23), 9 states have call predecessors, (23), 5 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 03:43:56,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:00,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:04,754 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) |c_check_#in~x|)) (.cse8 (bvmul |c_check_#res| (_ bv4 32))) (.cse4 (bvsge |c_check_#in~x| |c_check_#in~y|))) (and (exists ((v_check_~y_BEFORE_CALL_28 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_9 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv2 32) v_check_~y_BEFORE_CALL_28))) (and (bvslt (_ bv0 32) .cse0) (bvslt .cse0 (_ bv1073741824 32)) (not (bvsge (_ bv0 32) v_check_~y_BEFORE_CALL_28)) (not (let ((.cse1 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_9))) (bvsle (select .cse1 (_ bv0 32)) (select .cse1 (bvadd (_ bv4 32) (bvmul (_ bv4 32) v_check_~y_BEFORE_CALL_28))))))))) (let ((.cse3 (select |c_#memory_int#1| |c_check_#in~a.base|))) (let ((.cse2 (select .cse3 (bvadd |c_check_#in~a.offset| .cse5)))) (or (bvsle .cse2 (select .cse3 (bvadd |c_check_#in~a.offset| (bvmul |c_check_#in~y| (_ bv4 32))))) (bvsle (select .cse3 (bvadd |c_check_#in~a.offset| (bvmul (_ bv4 32) |c_check_#in~i|))) .cse2) .cse4 (not (bvsge |c_check_#in~x| (bvadd |c_check_#in~y| (_ bv4294967295 32))))))) (forall ((v_check_~i_BEFORE_CALL_16 (_ BitVec 32)) (v_check_~a.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_12 (_ BitVec 32))) (let ((.cse7 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_12))) (let ((.cse6 (select .cse7 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_16) v_check_~a.offset_BEFORE_CALL_14)))) (or (bvsle .cse6 (select .cse7 (bvadd .cse8 v_check_~a.offset_BEFORE_CALL_14))) (not (bvsle .cse6 (select .cse7 (bvadd .cse5 v_check_~a.offset_BEFORE_CALL_14)))))))) (or (forall ((v_check_~i_BEFORE_CALL_16 (_ BitVec 32)) (v_check_~a.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_12 (_ BitVec 32))) (let ((.cse9 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_12))) (bvsle (select .cse9 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_16) v_check_~a.offset_BEFORE_CALL_14)) (select .cse9 (bvadd .cse8 v_check_~a.offset_BEFORE_CALL_14))))) .cse4))) is different from false [2024-09-13 03:44:11,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:15,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:19,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:23,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:27,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:31,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:35,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:44:45,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:07,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:11,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:15,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:19,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul |c_check_#res| (_ bv4 32)))) (and (exists ((v_check_~y_BEFORE_CALL_28 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_9 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv2 32) v_check_~y_BEFORE_CALL_28))) (and (bvslt (_ bv0 32) .cse0) (bvslt .cse0 (_ bv1073741824 32)) (not (bvsge (_ bv0 32) v_check_~y_BEFORE_CALL_28)) (not (let ((.cse1 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_9))) (bvsle (select .cse1 (_ bv0 32)) (select .cse1 (bvadd (_ bv4 32) (bvmul (_ bv4 32) v_check_~y_BEFORE_CALL_28))))))))) (forall ((v_check_~i_BEFORE_CALL_16 (_ BitVec 32)) (v_check_~a.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_12 (_ BitVec 32))) (let ((.cse3 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_12))) (let ((.cse2 (select .cse3 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_16) v_check_~a.offset_BEFORE_CALL_14)))) (or (bvsle .cse2 (select .cse3 (bvadd .cse4 v_check_~a.offset_BEFORE_CALL_14))) (not (bvsle .cse2 (select .cse3 (bvadd (bvmul (_ bv4 32) |c_check_#in~x|) v_check_~a.offset_BEFORE_CALL_14)))))))) (or (forall ((v_check_~i_BEFORE_CALL_16 (_ BitVec 32)) (v_check_~a.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_check_~a.base_BEFORE_CALL_12 (_ BitVec 32))) (let ((.cse5 (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_12))) (bvsle (select .cse5 (bvadd (bvmul (_ bv4 32) v_check_~i_BEFORE_CALL_16) v_check_~a.offset_BEFORE_CALL_14)) (select .cse5 (bvadd .cse4 v_check_~a.offset_BEFORE_CALL_14))))) (bvsge |c_check_#in~x| |c_check_#in~y|)))) is different from false [2024-09-13 03:45:25,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:29,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:33,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:37,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:41,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:44,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:48,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:52,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:45:56,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:46:00,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:46:05,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:46:09,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:46:13,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:46:18,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:46:34,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:46:47,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:46:51,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:46:55,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:46:59,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:47:03,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:47:07,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:47:12,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:47:17,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-13 03:47:21,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:47:25,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-13 03:47:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:47:26,017 INFO L93 Difference]: Finished difference Result 376 states and 466 transitions. [2024-09-13 03:47:26,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-09-13 03:47:26,020 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 31 states have internal predecessors, (55), 14 states have call successors, (23), 9 states have call predecessors, (23), 5 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 61 [2024-09-13 03:47:26,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:47:26,023 INFO L225 Difference]: With dead ends: 376 [2024-09-13 03:47:26,023 INFO L226 Difference]: Without dead ends: 372 [2024-09-13 03:47:26,026 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2748 ImplicationChecksByTransitivity, 106.7s TimeCoverageRelationStatistics Valid=883, Invalid=9209, Unknown=16, NotChecked=398, Total=10506 [2024-09-13 03:47:26,026 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 179 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 161 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 160.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 161.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:47:26,026 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 716 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1088 Invalid, 37 Unknown, 82 Unchecked, 161.6s Time] [2024-09-13 03:47:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-09-13 03:47:26,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 326. [2024-09-13 03:47:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 195 states have (on average 1.1487179487179486) internal successors, (224), 212 states have internal predecessors, (224), 85 states have call successors, (85), 42 states have call predecessors, (85), 45 states have return successors, (94), 71 states have call predecessors, (94), 80 states have call successors, (94) [2024-09-13 03:47:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 403 transitions. [2024-09-13 03:47:26,166 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 403 transitions. Word has length 61 [2024-09-13 03:47:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:47:26,167 INFO L474 AbstractCegarLoop]: Abstraction has 326 states and 403 transitions. [2024-09-13 03:47:26,167 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 31 states have internal predecessors, (55), 14 states have call successors, (23), 9 states have call predecessors, (23), 5 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 03:47:26,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:47:26,167 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 403 transitions. [2024-09-13 03:47:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-13 03:47:26,169 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:47:26,169 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:47:26,176 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-09-13 03:47:26,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:47:26,369 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:47:26,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:47:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1759513950, now seen corresponding path program 1 times [2024-09-13 03:47:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:47:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065827631] [2024-09-13 03:47:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:47:26,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:47:26,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:47:26,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:47:26,372 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-09-13 03:47:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:47:26,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-13 03:47:26,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:48:08,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:48:08,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:48:08,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:48:08,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:48:08,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:48:08,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:48:08,436 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-13 03:48:09,829 INFO L349 Elim1Store]: treesize reduction 114, result has 50.0 percent of original size [2024-09-13 03:48:09,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 7 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 82 treesize of output 135 [2024-09-13 03:48:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:48:11,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:48:47,277 INFO L349 Elim1Store]: treesize reduction 65, result has 30.1 percent of original size [2024-09-13 03:48:47,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 39 [2024-09-13 03:48:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-13 03:48:50,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:48:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065827631] [2024-09-13 03:48:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065827631] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:48:50,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:48:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 20] total 46 [2024-09-13 03:48:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449169213] [2024-09-13 03:48:50,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:48:50,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-09-13 03:48:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:48:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-09-13 03:48:50,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1881, Unknown=10, NotChecked=0, Total=2070 [2024-09-13 03:48:50,688 INFO L87 Difference]: Start difference. First operand 326 states and 403 transitions. Second operand has 46 states, 39 states have (on average 1.435897435897436) internal successors, (56), 34 states have internal predecessors, (56), 13 states have call successors, (23), 9 states have call predecessors, (23), 7 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2024-09-13 03:48:56,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:49:00,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:49:01,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:49:17,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-13 03:49:35,294 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 03:49:46,283 WARN L293 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 87 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 03:50:00,695 WARN L293 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 92 DAG size of output: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15