./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/lcp.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.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 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:18:36,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:18:36,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:18:36,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:18:36,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:18:36,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:18:36,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:18:36,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:18:36,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:18:36,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:18:36,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:18:36,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:18:36,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:18:36,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:18:36,601 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:18:36,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:18:36,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:18:36,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:18:36,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:18:36,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:18:36,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:18:36,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:18:36,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:18:36,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:18:36,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:18:36,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:18:36,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:18:36,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:18:36,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:18:36,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:18:36,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:18:36,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:18:36,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:18:36,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:18:36,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:18:36,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:18:36,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:18:36,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:18:36,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:18:36,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:18:36,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:18:36,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:18:36,606 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 -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:18:36,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:18:36,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:18:36,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:18:36,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:18:36,825 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:18:36,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-24 23:18:37,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:18:38,151 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:18:38,152 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-24 23:18:38,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4b1dd7dd5/e21acc63071c49a58571eefe28876652/FLAGa4d54670c [2024-09-24 23:18:38,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4b1dd7dd5/e21acc63071c49a58571eefe28876652 [2024-09-24 23:18:38,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:18:38,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:18:38,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:18:38,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:18:38,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:18:38,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269aa88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38, skipping insertion in model container [2024-09-24 23:18:38,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:18:38,692 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c[515,528] [2024-09-24 23:18:38,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:18:38,716 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:18:38,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c[515,528] [2024-09-24 23:18:38,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:18:38,752 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:18:38,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38 WrapperNode [2024-09-24 23:18:38,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:18:38,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:18:38,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:18:38,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:18:38,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,771 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:18:38,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:18:38,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:18:38,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:18:38,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:18:38,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,805 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-09-24 23:18:38,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:18:38,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:18:38,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:18:38,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:18:38,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (1/1) ... [2024-09-24 23:18:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:18:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:18:38,852 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-24 23:18:38,853 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-24 23:18:38,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:18:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:18:38,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:18:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:18:38,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:18:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:18:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-24 23:18:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-24 23:18:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-24 23:18:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-24 23:18:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:18:38,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:18:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-24 23:18:38,889 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-24 23:18:38,890 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-24 23:18:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:18:38,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:18:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-24 23:18:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-24 23:18:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-24 23:18:38,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-24 23:18:38,891 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-24 23:18:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:18:38,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:18:38,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 23:18:38,967 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:18:38,968 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:18:39,142 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-24 23:18:39,143 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:18:39,177 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:18:39,177 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-24 23:18:39,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:18:39 BoogieIcfgContainer [2024-09-24 23:18:39,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:18:39,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:18:39,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:18:39,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:18:39,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:18:38" (1/3) ... [2024-09-24 23:18:39,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128560c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:18:39, skipping insertion in model container [2024-09-24 23:18:39,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:38" (2/3) ... [2024-09-24 23:18:39,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128560c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:18:39, skipping insertion in model container [2024-09-24 23:18:39,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:18:39" (3/3) ... [2024-09-24 23:18:39,196 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-24 23:18:39,222 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:18:39,222 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:18:39,262 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:18:39,267 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;@1b5009e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:18:39,267 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:18:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:18:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-24 23:18:39,275 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:39,275 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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-24 23:18:39,276 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:39,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-24 23:18:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:18:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724478114] [2024-09-24 23:18:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:18:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,423 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:18:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:18:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:18:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-24 23:18:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-24 23:18:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:18:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:18:39,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:18:39,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724478114] [2024-09-24 23:18:39,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724478114] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:18:39,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:18:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 23:18:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254261220] [2024-09-24 23:18:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:18:39,495 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 23:18:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:18:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 23:18:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:18:39,513 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:18:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:39,624 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-24 23:18:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:18:39,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2024-09-24 23:18:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:39,633 INFO L225 Difference]: With dead ends: 82 [2024-09-24 23:18:39,634 INFO L226 Difference]: Without dead ends: 38 [2024-09-24 23:18:39,637 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-24 23:18:39,640 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:39,641 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 22 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:18:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-24 23:18:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-24 23:18:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:18:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-24 23:18:39,674 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-24 23:18:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:39,675 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-24 23:18:39,676 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:18:39,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-24 23:18:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-24 23:18:39,678 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:39,678 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-24 23:18:39,679 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:18:39,679 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:39,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-24 23:18:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:18:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197308981] [2024-09-24 23:18:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:18:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:18:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:18:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:39,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:18:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-24 23:18:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-24 23:18:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 23:18:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:18:40,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:18:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197308981] [2024-09-24 23:18:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197308981] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:18:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:18:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-24 23:18:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666349239] [2024-09-24 23:18:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:18:40,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 23:18:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:18:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 23:18:40,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-24 23:18:40,084 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:18:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:40,306 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-24 23:18:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:18:40,307 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-24 23:18:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:40,308 INFO L225 Difference]: With dead ends: 60 [2024-09-24 23:18:40,308 INFO L226 Difference]: Without dead ends: 39 [2024-09-24 23:18:40,308 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-09-24 23:18:40,309 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:40,310 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 44 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:18:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-24 23:18:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-24 23:18:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 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), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:18:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-24 23:18:40,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 40 [2024-09-24 23:18:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:40,316 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-24 23:18:40,316 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:18:40,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-24 23:18:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-24 23:18:40,317 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:40,318 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-24 23:18:40,318 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:18:40,318 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:40,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1492030389, now seen corresponding path program 1 times [2024-09-24 23:18:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:18:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350687836] [2024-09-24 23:18:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:18:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:18:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:18:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:18:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-24 23:18:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-24 23:18:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 23:18:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:18:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:18:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350687836] [2024-09-24 23:18:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350687836] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:18:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:18:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-24 23:18:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311285237] [2024-09-24 23:18:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:18:40,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 23:18:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:18:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 23:18:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:18:40,501 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:18:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:40,703 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-09-24 23:18:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 23:18:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-09-24 23:18:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:40,704 INFO L225 Difference]: With dead ends: 45 [2024-09-24 23:18:40,704 INFO L226 Difference]: Without dead ends: 41 [2024-09-24 23:18:40,705 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-09-24 23:18:40,705 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:40,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 65 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:18:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-24 23:18:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-24 23:18:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:18:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-24 23:18:40,711 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 40 [2024-09-24 23:18:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:40,711 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-24 23:18:40,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-24 23:18:40,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-24 23:18:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-24 23:18:40,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:40,713 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:18:40,713 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:18:40,713 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:40,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:40,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1098010380, now seen corresponding path program 1 times [2024-09-24 23:18:40,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:18:40,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011166980] [2024-09-24 23:18:40,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:18:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:18:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:18:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:18:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,949 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-24 23:18:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:40,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-24 23:18:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 23:18:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-24 23:18:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:18:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:18:41,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011166980] [2024-09-24 23:18:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011166980] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:18:41,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:18:41,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-24 23:18:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336435856] [2024-09-24 23:18:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:18:41,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 23:18:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:18:41,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 23:18:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:18:41,107 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:18:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:41,411 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-09-24 23:18:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 23:18:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2024-09-24 23:18:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:41,414 INFO L225 Difference]: With dead ends: 60 [2024-09-24 23:18:41,414 INFO L226 Difference]: Without dead ends: 45 [2024-09-24 23:18:41,415 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-09-24 23:18:41,415 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:41,416 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 81 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:18:41,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-24 23:18:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-24 23:18:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 10 states have call successors, (10), 8 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:18:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-24 23:18:41,424 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 47 [2024-09-24 23:18:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:41,425 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-24 23:18:41,425 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:18:41,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-24 23:18:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-24 23:18:41,426 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:41,426 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, 1, 1, 1, 1] [2024-09-24 23:18:41,426 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 23:18:41,426 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:41,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-24 23:18:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:18:41,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987914546] [2024-09-24 23:18:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:41,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:18:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:18:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:18:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:18:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-24 23:18:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-24 23:18:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:18:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-24 23:18:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-24 23:18:41,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:18:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987914546] [2024-09-24 23:18:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987914546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:18:41,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132851735] [2024-09-24 23:18:41,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:41,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:18:41,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:18:41,680 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-24 23:18:41,682 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-24 23:18:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:41,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-24 23:18:41,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:18:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-24 23:18:42,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:18:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-24 23:18:42,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132851735] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:18:42,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:18:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-09-24 23:18:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853846248] [2024-09-24 23:18:42,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:18:42,271 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 23:18:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:18:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 23:18:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-09-24 23:18:42,272 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:18:42,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:42,498 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-09-24 23:18:42,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-24 23:18:42,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2024-09-24 23:18:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:42,499 INFO L225 Difference]: With dead ends: 46 [2024-09-24 23:18:42,499 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:18:42,499 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-09-24 23:18:42,500 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:42,500 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 91 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:18:42,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:18:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:18:42,501 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-24 23:18:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:18:42,501 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-24 23:18:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:42,501 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:18:42,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:18:42,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:18:42,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:18:42,506 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:18:42,519 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:18:42,710 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:18:42,713 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-24 23:18:42,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 23:18:43,276 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 23:18:43,284 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!base [2024-09-24 23:18:43,284 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-09-24 23:18:43,291 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.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.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) 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:60) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:171) 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-24 23:18:43,294 INFO L158 Benchmark]: Toolchain (without parser) took 4726.90ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 101.9MB in the beginning and 131.2MB in the end (delta: -29.2MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-09-24 23:18:43,294 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:18:43,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.66ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 89.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-24 23:18:43,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.76ms. Allocated memory is still 172.0MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 993.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:18:43,295 INFO L158 Benchmark]: Boogie Preprocessor took 52.82ms. Allocated memory is still 172.0MB. Free memory was 88.8MB in the beginning and 86.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:18:43,295 INFO L158 Benchmark]: RCFGBuilder took 351.84ms. Allocated memory is still 172.0MB. Free memory was 86.7MB in the beginning and 142.3MB in the end (delta: -55.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-09-24 23:18:43,295 INFO L158 Benchmark]: TraceAbstraction took 4108.15ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 141.3MB in the beginning and 131.2MB in the end (delta: 10.1MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2024-09-24 23:18:43,296 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.14ms. Allocated memory is still 123.7MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.66ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 89.8MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.76ms. Allocated memory is still 172.0MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 993.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.82ms. Allocated memory is still 172.0MB. Free memory was 88.8MB in the beginning and 86.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.84ms. Allocated memory is still 172.0MB. Free memory was 86.7MB in the beginning and 142.3MB in the end (delta: -55.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4108.15ms. Allocated memory was 172.0MB in the beginning and 213.9MB in the end (delta: 41.9MB). Free memory was 141.3MB in the beginning and 131.2MB in the end (delta: 10.1MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~a!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~a!base * 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: 13]: 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 8 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 66 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 308 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 12 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 95/101 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 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((\old(x) == x) && (\old(y) == y)) && (\old(n) == n)) - 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-24 23:18:43,320 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/lcp.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 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:18:45,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:18:45,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-24 23:18:45,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:18:45,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:18:45,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:18:45,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:18:45,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:18:45,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:18:45,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:18:45,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:18:45,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:18:45,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:18:45,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:18:45,178 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:18:45,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:18:45,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:18:45,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:18:45,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:18:45,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:18:45,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:18:45,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:18:45,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:18:45,183 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-24 23:18:45,183 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-24 23:18:45,183 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:18:45,183 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-24 23:18:45,183 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:18:45,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:18:45,184 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:18:45,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:18:45,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:18:45,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:18:45,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:18:45,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:18:45,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:18:45,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:18:45,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:18:45,185 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-24 23:18:45,185 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-24 23:18:45,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:18:45,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:18:45,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:18:45,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:18:45,187 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-24 23:18:45,187 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 -> 1e47fbc54bff4eeebe072cdb8acf7cfe734a91f148fd421ae1769ba3b81a6f5a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:18:45,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:18:45,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:18:45,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:18:45,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:18:45,456 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:18:45,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-24 23:18:46,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:18:46,877 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:18:46,877 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-24 23:18:46,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/169d2c7aa/b6474fc01c5e4753b0aba52ff48a368d/FLAGf3893b361 [2024-09-24 23:18:46,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/169d2c7aa/b6474fc01c5e4753b0aba52ff48a368d [2024-09-24 23:18:46,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:18:46,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:18:46,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:18:46,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:18:46,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:18:46,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:18:46" (1/1) ... [2024-09-24 23:18:46,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca35750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:46, skipping insertion in model container [2024-09-24 23:18:46,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:18:46" (1/1) ... [2024-09-24 23:18:46,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:18:47,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c[515,528] [2024-09-24 23:18:47,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:18:47,088 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:18:47,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c[515,528] [2024-09-24 23:18:47,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:18:47,126 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:18:47,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47 WrapperNode [2024-09-24 23:18:47,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:18:47,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:18:47,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:18:47,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:18:47,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,160 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:18:47,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:18:47,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:18:47,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:18:47,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:18:47,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,184 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 6, 7]. 47 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 1 writes are split as follows [0, 0, 1]. [2024-09-24 23:18:47,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:18:47,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:18:47,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:18:47,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:18:47,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (1/1) ... [2024-09-24 23:18:47,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:18:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:18:47,224 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-24 23:18:47,226 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-24 23:18:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:18:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-24 23:18:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-24 23:18:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-09-24 23:18:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:18:47,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:18:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-24 23:18:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:18:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-24 23:18:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-24 23:18:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:18:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:18:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-24 23:18:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-24 23:18:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:18:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:18:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 23:18:47,329 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:18:47,330 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:18:47,531 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-24 23:18:47,531 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:18:47,561 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:18:47,564 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-24 23:18:47,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:18:47 BoogieIcfgContainer [2024-09-24 23:18:47,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:18:47,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:18:47,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:18:47,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:18:47,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:18:46" (1/3) ... [2024-09-24 23:18:47,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d799f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:18:47, skipping insertion in model container [2024-09-24 23:18:47,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:18:47" (2/3) ... [2024-09-24 23:18:47,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d799f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:18:47, skipping insertion in model container [2024-09-24 23:18:47,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:18:47" (3/3) ... [2024-09-24 23:18:47,573 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-24 23:18:47,585 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:18:47,585 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:18:47,642 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:18:47,649 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;@17a7caa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:18:47,650 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:18:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-24 23:18:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-24 23:18:47,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:47,660 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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-24 23:18:47,660 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:47,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-24 23:18:47,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:18:47,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111049990] [2024-09-24 23:18:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:47,676 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-24 23:18:47,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:18:47,679 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-24 23:18:47,680 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-24 23:18:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:47,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-24 23:18:47,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:18:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:18:47,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:18:47,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:18:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111049990] [2024-09-24 23:18:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111049990] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:18:47,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:18:47,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:18:47,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894174568] [2024-09-24 23:18:47,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:18:47,811 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:18:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:18:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:18:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:18:47,832 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:18:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:47,860 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-24 23:18:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:18:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2024-09-24 23:18:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:47,867 INFO L225 Difference]: With dead ends: 82 [2024-09-24 23:18:47,868 INFO L226 Difference]: Without dead ends: 38 [2024-09-24 23:18:47,871 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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-24 23:18:47,873 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:47,874 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:18:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-24 23:18:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-24 23:18:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:18:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-24 23:18:47,908 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-24 23:18:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:47,909 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-24 23:18:47,909 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:18:47,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-24 23:18:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-24 23:18:47,910 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:47,911 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-24 23:18:47,918 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-24 23:18:48,111 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-24 23:18:48,112 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:48,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-24 23:18:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:18:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827523387] [2024-09-24 23:18:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:48,113 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-24 23:18:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:18:48,115 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-24 23:18:48,116 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-24 23:18:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:48,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-24 23:18:48,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:18:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:18:48,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:18:48,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:18:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827523387] [2024-09-24 23:18:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827523387] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:18:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:18:48,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-24 23:18:48,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069472045] [2024-09-24 23:18:48,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:18:48,360 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 23:18:48,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:18:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 23:18:48,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:18:48,363 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 10 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:18:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:18:48,505 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-24 23:18:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 23:18:48,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-09-24 23:18:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:18:48,507 INFO L225 Difference]: With dead ends: 58 [2024-09-24 23:18:48,507 INFO L226 Difference]: Without dead ends: 41 [2024-09-24 23:18:48,508 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:18:48,509 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:18:48,509 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 258 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:18:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-24 23:18:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-24 23:18:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:18:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-24 23:18:48,515 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 40 [2024-09-24 23:18:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:18:48,516 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-24 23:18:48,516 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:18:48,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-24 23:18:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-24 23:18:48,518 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:18:48,518 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] [2024-09-24 23:18:48,521 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 (3)] Ended with exit code 0 [2024-09-24 23:18:48,722 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-24 23:18:48,722 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:18:48,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:18:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 46925806, now seen corresponding path program 1 times [2024-09-24 23:18:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:18:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962144719] [2024-09-24 23:18:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:48,725 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-24 23:18:48,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:18:48,726 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-24 23:18:48,731 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-24 23:18:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:48,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-24 23:18:48,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:18:49,381 INFO L349 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2024-09-24 23:18:49,382 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 42 treesize of output 16 [2024-09-24 23:18:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:18:49,464 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:18:57,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:18:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962144719] [2024-09-24 23:18:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962144719] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:18:57,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007671964] [2024-09-24 23:18:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:18:57,758 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-24 23:18:57,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-24 23:18:57,760 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-24 23:18:57,761 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-09-24 23:18:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:18:57,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:18:57,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:18:57,893 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-24 23:19:02,035 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_2) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-24 23:19:06,127 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_3))) is different from true [2024-09-24 23:19:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-24 23:19:18,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:19:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2007671964] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:19:34,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:19:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2024-09-24 23:19:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680651348] [2024-09-24 23:19:34,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:19:34,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-24 23:19:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:19:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-24 23:19:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=800, Unknown=11, NotChecked=114, Total=992 [2024-09-24 23:19:34,925 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 27 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-24 23:20:16,095 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-24 23:21:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:21:18,018 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-09-24 23:21:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-24 23:21:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2024-09-24 23:21:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:21:18,020 INFO L225 Difference]: With dead ends: 89 [2024-09-24 23:21:18,020 INFO L226 Difference]: Without dead ends: 66 [2024-09-24 23:21:18,021 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 143.6s TimeCoverageRelationStatistics Valid=254, Invalid=2916, Unknown=30, NotChecked=222, Total=3422 [2024-09-24 23:21:18,022 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-09-24 23:21:18,023 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 385 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 620 Invalid, 1 Unknown, 149 Unchecked, 4.9s Time] [2024-09-24 23:21:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-24 23:21:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-09-24 23:21:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-24 23:21:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-24 23:21:18,044 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 43 [2024-09-24 23:21:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:21:18,045 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-24 23:21:18,045 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 19 states have (on average 2.473684210526316) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-24 23:21:18,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:21:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-24 23:21:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-24 23:21:18,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:21:18,046 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] [2024-09-24 23:21:18,052 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-24 23:21:18,250 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-09-24 23:21:18,447 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,5 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-24 23:21:18,447 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:21:18,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:21:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1935896750, now seen corresponding path program 1 times [2024-09-24 23:21:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:21:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762125737] [2024-09-24 23:21:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:21:18,449 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-24 23:21:18,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:21:18,450 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-24 23:21:18,450 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-24 23:21:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:21:18,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-24 23:21:18,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:21:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-24 23:21:18,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:21:18,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:21:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762125737] [2024-09-24 23:21:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762125737] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:21:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:21:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 23:21:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536622800] [2024-09-24 23:21:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:21:18,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 23:21:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:21:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 23:21:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:21:18,501 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:21:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:21:18,528 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-09-24 23:21:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:21:18,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-09-24 23:21:18,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:21:18,530 INFO L225 Difference]: With dead ends: 87 [2024-09-24 23:21:18,530 INFO L226 Difference]: Without dead ends: 61 [2024-09-24 23:21:18,531 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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-24 23:21:18,531 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:21:18,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:21:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-24 23:21:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-24 23:21:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-24 23:21:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-09-24 23:21:18,552 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 43 [2024-09-24 23:21:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:21:18,553 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-09-24 23:21:18,553 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:21:18,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:21:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-09-24 23:21:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-24 23:21:18,557 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:21:18,557 INFO L216 NwaCegarLoop]: trace histogram [3, 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] [2024-09-24 23:21:18,561 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 (6)] Ended with exit code 0 [2024-09-24 23:21:18,758 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-24 23:21:18,758 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:21:18,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:21:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 204017195, now seen corresponding path program 1 times [2024-09-24 23:21:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:21:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247533543] [2024-09-24 23:21:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:21:18,759 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-24 23:21:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:21:18,762 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-24 23:21:18,762 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-24 23:21:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:21:18,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-24 23:21:18,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:21:21,282 INFO L349 Elim1Store]: treesize reduction 104, result has 39.9 percent of original size [2024-09-24 23:21:21,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 61 treesize of output 81 [2024-09-24 23:21:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:21:21,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:21:29,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:21:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247533543] [2024-09-24 23:21:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247533543] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:21:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [203740040] [2024-09-24 23:21:29,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:21:29,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-24 23:21:29,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-24 23:21:29,983 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-24 23:21:29,984 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-24 23:21:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:21:30,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-24 23:21:30,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:21:30,085 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-24 23:21:34,337 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_5) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-24 23:21:38,442 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (select |c_#memory_int#2| v_main_~a~0.base_BEFORE_CALL_6) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-24 23:21:42,715 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#2| v_check_~a.base_BEFORE_CALL_3))) is different from true [2024-09-24 23:21:42,834 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 35 treesize of output 29 [2024-09-24 23:21:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2024-09-24 23:21:42,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:22:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [203740040] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:22:11,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:22:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-24 23:22:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287424774] [2024-09-24 23:22:11,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:22:11,164 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-24 23:22:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:22:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-24 23:22:11,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=12, NotChecked=204, Total=1406 [2024-09-24 23:22:11,166 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 33 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-24 23:22:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:22:44,486 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-09-24 23:22:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-24 23:22:44,486 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 46 [2024-09-24 23:22:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:22:44,487 INFO L225 Difference]: With dead ends: 87 [2024-09-24 23:22:44,487 INFO L226 Difference]: Without dead ends: 83 [2024-09-24 23:22:44,488 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 81.8s TimeCoverageRelationStatistics Valid=224, Invalid=2963, Unknown=17, NotChecked=336, Total=3540 [2024-09-24 23:22:44,489 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 477 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:22:44,489 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 507 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1058 Invalid, 0 Unknown, 477 Unchecked, 2.3s Time] [2024-09-24 23:22:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-24 23:22:44,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2024-09-24 23:22:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 10 states have call successors, (10), 10 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:22:44,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-24 23:22:44,501 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2024-09-24 23:22:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:22:44,502 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-24 23:22:44,502 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-24 23:22:44,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:22:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-24 23:22:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-24 23:22:44,503 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:22:44,503 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, 1, 1, 1, 1] [2024-09-24 23:22:44,513 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-24 23:22:44,707 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-24 23:22:44,904 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-24 23:22:44,905 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:22:44,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:22:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-24 23:22:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:22:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687795983] [2024-09-24 23:22:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:22:44,906 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-24 23:22:44,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:22:44,907 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-24 23:22:44,908 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-24 23:22:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:22:45,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-24 23:22:45,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:22:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:22:45,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:22:47,339 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-24 23:22:47,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:22:47,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687795983] [2024-09-24 23:22:47,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687795983] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:22:47,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:22:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2024-09-24 23:22:47,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369087976] [2024-09-24 23:22:47,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:22:47,340 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-24 23:22:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:22:47,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-24 23:22:47,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-09-24 23:22:47,341 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 28 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-24 23:22:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:22:49,637 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-09-24 23:22:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-24 23:22:49,638 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 50 [2024-09-24 23:22:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:22:49,639 INFO L225 Difference]: With dead ends: 90 [2024-09-24 23:22:49,639 INFO L226 Difference]: Without dead ends: 61 [2024-09-24 23:22:49,640 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2024-09-24 23:22:49,640 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-24 23:22:49,640 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 484 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-24 23:22:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-24 23:22:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-24 23:22:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 10 states have call successors, (10), 10 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:22:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-09-24 23:22:49,657 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 50 [2024-09-24 23:22:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:22:49,657 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-09-24 23:22:49,658 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-24 23:22:49,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:22:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-09-24 23:22:49,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-24 23:22:49,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:22:49,659 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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-24 23:22:49,663 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-24 23:22:49,859 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-24 23:22:49,859 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:22:49,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:22:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 972856628, now seen corresponding path program 2 times [2024-09-24 23:22:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:22:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914018834] [2024-09-24 23:22:49,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:22:49,860 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-24 23:22:49,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:22:49,862 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-24 23:22:49,863 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-24 23:22:50,166 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:22:50,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:22:50,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-24 23:22:50,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:22:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:22:51,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:22:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:22:53,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:22:53,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914018834] [2024-09-24 23:22:53,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914018834] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:22:53,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:22:53,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2024-09-24 23:22:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634139966] [2024-09-24 23:22:53,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:22:53,368 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-24 23:22:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:22:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-24 23:22:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2024-09-24 23:22:53,371 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 34 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-24 23:23:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:23:01,300 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-09-24 23:23:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-24 23:23:01,301 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 59 [2024-09-24 23:23:01,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:23:01,302 INFO L225 Difference]: With dead ends: 114 [2024-09-24 23:23:01,302 INFO L226 Difference]: Without dead ends: 79 [2024-09-24 23:23:01,303 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=558, Invalid=3224, Unknown=0, NotChecked=0, Total=3782 [2024-09-24 23:23:01,303 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:23:01,304 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 465 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-09-24 23:23:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-24 23:23:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-24 23:23:01,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 23:23:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2024-09-24 23:23:01,339 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 59 [2024-09-24 23:23:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:23:01,340 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2024-09-24 23:23:01,340 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 8 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-09-24 23:23:01,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:23:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2024-09-24 23:23:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-24 23:23:01,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:23:01,341 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 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-24 23:23:01,347 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 (10)] Forceful destruction successful, exit code 0 [2024-09-24 23:23:01,541 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-24 23:23:01,541 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:23:01,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:23:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1516811372, now seen corresponding path program 3 times [2024-09-24 23:23:01,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-24 23:23:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008199249] [2024-09-24 23:23:01,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 23:23:01,542 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-24 23:23:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-24 23:23:01,543 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-24 23:23:01,544 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-24 23:23:02,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-24 23:23:02,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:23:02,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-24 23:23:02,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:23:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-09-24 23:23:02,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:23:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-09-24 23:23:04,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-24 23:23:04,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008199249] [2024-09-24 23:23:04,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008199249] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:23:04,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:23:04,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-09-24 23:23:04,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255421406] [2024-09-24 23:23:04,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:23:04,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-24 23:23:04,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-24 23:23:04,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-24 23:23:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-09-24 23:23:04,654 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 7 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-24 23:23:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:23:05,495 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2024-09-24 23:23:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 23:23:05,496 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 7 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 77 [2024-09-24 23:23:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:23:05,497 INFO L225 Difference]: With dead ends: 78 [2024-09-24 23:23:05,497 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:23:05,498 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-09-24 23:23:05,498 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-24 23:23:05,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 253 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-24 23:23:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:23:05,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:23:05,499 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-24 23:23:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:23:05,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2024-09-24 23:23:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:23:05,499 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:23:05,499 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 7 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-24 23:23:05,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:23:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:23:05,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:23:05,501 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:23:05,509 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 (11)] Ended with exit code 0 [2024-09-24 23:23:05,702 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-24 23:23:05,705 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-09-24 23:23:05,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.