./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 de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/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-de32597-m [2024-09-17 18:30:59,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:30:59,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:30:59,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:30:59,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:30:59,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:30:59,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:30:59,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:30:59,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:30:59,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:30:59,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:30:59,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:30:59,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:30:59,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:30:59,285 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:30:59,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:30:59,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:30:59,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:30:59,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:30:59,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:30:59,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:30:59,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:30:59,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:30:59,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:30:59,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:30:59,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:30:59,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:30:59,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:30:59,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:30:59,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:30:59,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:30:59,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:30:59,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:30:59,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:30:59,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:30:59,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:30:59,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:30:59,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:30:59,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:30:59,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:30:59,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:30:59,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:30:59,295 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-17 18:30:59,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:30:59,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:30:59,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:30:59,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:30:59,611 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:30:59,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-17 18:31:01,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:31:01,351 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:31:01,353 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-17 18:31:01,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7c3778cdb/f119fdcf514d4b14877950fa9a0ef997/FLAG7104fc194 [2024-09-17 18:31:01,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7c3778cdb/f119fdcf514d4b14877950fa9a0ef997 [2024-09-17 18:31:01,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:31:01,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:31:01,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:01,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:31:01,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:31:01,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657a979f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01, skipping insertion in model container [2024-09-17 18:31:01,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:31:01,608 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-17 18:31:01,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:01,653 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:31:01,667 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-17 18:31:01,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:01,692 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:31:01,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01 WrapperNode [2024-09-17 18:31:01,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:01,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:01,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:31:01,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:31:01,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,718 INFO L138 Inliner]: procedures = 20, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:31:01,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:01,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:31:01,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:31:01,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:31:01,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,759 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-17 18:31:01,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:31:01,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:31:01,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:31:01,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:31:01,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:31:01,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:31:01,824 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-17 18:31:01,827 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-17 18:31:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:31:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 18:31:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 18:31:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:31:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:31:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:31:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-17 18:31:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-17 18:31:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-17 18:31:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-17 18:31:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:31:01,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:31:01,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-17 18:31:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-17 18:31:01,885 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-17 18:31:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:31:01,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:31:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-17 18:31:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-17 18:31:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-17 18:31:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-17 18:31:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-17 18:31:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:31:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:31:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 18:31:01,995 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:31:01,998 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:31:02,225 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-17 18:31:02,225 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:31:02,250 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:31:02,251 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-17 18:31:02,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:02 BoogieIcfgContainer [2024-09-17 18:31:02,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:31:02,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:31:02,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:31:02,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:31:02,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:31:01" (1/3) ... [2024-09-17 18:31:02,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feb79f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:02, skipping insertion in model container [2024-09-17 18:31:02,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (2/3) ... [2024-09-17 18:31:02,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6feb79f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:02, skipping insertion in model container [2024-09-17 18:31:02,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:02" (3/3) ... [2024-09-17 18:31:02,260 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-17 18:31:02,276 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:31:02,277 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:31:02,332 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:31:02,339 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;@2ccc3418, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:31:02,339 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:31:02,344 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-17 18:31:02,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-17 18:31:02,352 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:02,353 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-17 18:31:02,354 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:02,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:02,360 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-17 18:31:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51392570] [2024-09-17 18:31:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:02,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-17 18:31:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-17 18:31:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:31:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,652 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-17 18:31:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51392570] [2024-09-17 18:31:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51392570] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:02,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:02,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 18:31:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105742366] [2024-09-17 18:31:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:02,660 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 18:31:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 18:31:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:31:02,687 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-17 18:31:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:02,819 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-17 18:31:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 18:31:02,822 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-17 18:31:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:02,829 INFO L225 Difference]: With dead ends: 82 [2024-09-17 18:31:02,829 INFO L226 Difference]: Without dead ends: 38 [2024-09-17 18:31:02,832 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-17 18:31:02,835 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-17 18:31:02,836 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-17 18:31:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-17 18:31:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-17 18:31:02,956 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-17 18:31:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-17 18:31:02,963 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-17 18:31:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:02,964 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-17 18:31:02,964 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-17 18:31:02,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-17 18:31:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-17 18:31:02,971 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:02,971 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-17 18:31:02,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:31:02,972 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:02,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-17 18:31:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797172376] [2024-09-17 18:31:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-17 18:31:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-17 18:31:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-17 18:31:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,616 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-17 18:31:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797172376] [2024-09-17 18:31:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797172376] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-17 18:31:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981396649] [2024-09-17 18:31:03,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:03,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-17 18:31:03,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:03,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-17 18:31:03,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-09-17 18:31:03,623 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-17 18:31:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:03,899 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-09-17 18:31:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 18:31:03,900 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-17 18:31:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:03,901 INFO L225 Difference]: With dead ends: 60 [2024-09-17 18:31:03,901 INFO L226 Difference]: Without dead ends: 39 [2024-09-17 18:31:03,902 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-17 18:31:03,903 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-17 18:31:03,905 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-17 18:31:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-17 18:31:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-17 18:31:03,917 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-17 18:31:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-17 18:31:03,920 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 40 [2024-09-17 18:31:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:03,921 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-17 18:31:03,921 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-17 18:31:03,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-17 18:31:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-17 18:31:03,943 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:03,943 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-17 18:31:03,943 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 18:31:03,943 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:03,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1492030389, now seen corresponding path program 1 times [2024-09-17 18:31:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:03,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033937275] [2024-09-17 18:31:03,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-17 18:31:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-17 18:31:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-17 18:31:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,274 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-17 18:31:04,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:04,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033937275] [2024-09-17 18:31:04,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033937275] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:04,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:04,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-17 18:31:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997389244] [2024-09-17 18:31:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:04,276 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-17 18:31:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-17 18:31:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-09-17 18:31:04,277 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-17 18:31:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:04,548 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-09-17 18:31:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-17 18:31:04,549 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-17 18:31:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:04,550 INFO L225 Difference]: With dead ends: 45 [2024-09-17 18:31:04,550 INFO L226 Difference]: Without dead ends: 41 [2024-09-17 18:31:04,551 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-17 18:31:04,552 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:31:04,552 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.2s Time] [2024-09-17 18:31:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-17 18:31:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-17 18:31:04,560 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-17 18:31:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-09-17 18:31:04,562 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 40 [2024-09-17 18:31:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:04,563 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-09-17 18:31:04,563 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-17 18:31:04,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-09-17 18:31:04,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-17 18:31:04,566 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:04,566 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-17 18:31:04,566 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 18:31:04,566 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:04,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1098010380, now seen corresponding path program 1 times [2024-09-17 18:31:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747332751] [2024-09-17 18:31:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-17 18:31:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:04,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-17 18:31:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-17 18:31:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-17 18:31:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,091 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-17 18:31:05,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:05,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747332751] [2024-09-17 18:31:05,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747332751] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:05,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:05,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-17 18:31:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236686199] [2024-09-17 18:31:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:05,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-17 18:31:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:05,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-17 18:31:05,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-09-17 18:31:05,094 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-17 18:31:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:05,467 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-09-17 18:31:05,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-17 18:31:05,468 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-17 18:31:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:05,469 INFO L225 Difference]: With dead ends: 60 [2024-09-17 18:31:05,470 INFO L226 Difference]: Without dead ends: 45 [2024-09-17 18:31:05,470 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-17 18:31:05,471 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-17 18:31:05,472 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-17 18:31:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-17 18:31:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-17 18:31:05,490 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-17 18:31:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-17 18:31:05,491 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 47 [2024-09-17 18:31:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:05,492 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-17 18:31:05,492 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-17 18:31:05,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-17 18:31:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-17 18:31:05,494 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:05,494 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-17 18:31:05,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-17 18:31:05,494 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:05,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-17 18:31:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055647678] [2024-09-17 18:31:05,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:05,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-17 18:31:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-17 18:31:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:31:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-17 18:31:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,835 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-17 18:31:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055647678] [2024-09-17 18:31:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055647678] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:31:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449088958] [2024-09-17 18:31:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:05,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:31:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:31:05,838 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-17 18:31:05,840 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-17 18:31:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:05,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-17 18:31:05,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:06,311 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-17 18:31:06,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:31:06,660 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-17 18:31:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449088958] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:31:06,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:31:06,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2024-09-17 18:31:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864099382] [2024-09-17 18:31:06,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:31:06,662 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-17 18:31:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-17 18:31:06,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-09-17 18:31:06,664 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-17 18:31:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:06,989 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-09-17 18:31:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-17 18:31:06,990 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-17 18:31:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:06,991 INFO L225 Difference]: With dead ends: 46 [2024-09-17 18:31:06,991 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 18:31:06,992 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-17 18:31:06,993 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-17 18:31:06,993 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.2s Time] [2024-09-17 18:31:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 18:31:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 18:31:06,994 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-17 18:31:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 18:31:06,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-17 18:31:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:06,996 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 18:31:06,996 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-17 18:31:06,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 18:31:06,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 18:31:07,001 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 18:31:07,024 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-17 18:31:07,205 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-17 18:31:07,209 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-17 18:31:07,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 18:31:07,960 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 18:31:07,973 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~a!base [2024-09-17 18:31:07,974 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!base [2024-09-17 18:31:07,983 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.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:126) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:109) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionToString(BacktranslationService.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:60) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-17 18:31:07,987 INFO L158 Benchmark]: Toolchain (without parser) took 6603.01ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 83.1MB in the beginning and 141.1MB in the end (delta: -58.0MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-09-17 18:31:07,987 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:31:07,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.50ms. Allocated memory is still 153.1MB. Free memory was 82.9MB in the beginning and 115.4MB in the end (delta: -32.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-09-17 18:31:07,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.91ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 114.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:31:07,988 INFO L158 Benchmark]: Boogie Preprocessor took 66.51ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:31:07,988 INFO L158 Benchmark]: RCFGBuilder took 465.00ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 95.5MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-17 18:31:07,989 INFO L158 Benchmark]: TraceAbstraction took 5733.45ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 95.0MB in the beginning and 141.1MB in the end (delta: -46.1MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2024-09-17 18:31:07,990 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.50ms. Allocated memory is still 153.1MB. Free memory was 82.9MB in the beginning and 115.4MB in the end (delta: -32.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.91ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 114.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 66.51ms. Allocated memory is still 153.1MB. Free memory was 114.4MB in the beginning and 112.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 465.00ms. Allocated memory is still 153.1MB. Free memory was 112.3MB in the beginning and 95.5MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5733.45ms. Allocated memory was 153.1MB in the beginning and 220.2MB in the end (delta: 67.1MB). Free memory was 95.0MB in the beginning and 141.1MB in the end (delta: -46.1MB). Peak memory consumption was 96.0MB. 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: 4.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.8s 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.7s 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s 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-17 18:31:08,023 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/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-de32597-m [2024-09-17 18:31:10,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:31:10,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-17 18:31:10,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:31:10,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:31:10,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:31:10,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:31:10,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:31:10,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:31:10,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:31:10,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:31:10,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:31:10,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:31:10,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:31:10,315 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:31:10,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:31:10,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:31:10,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:31:10,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:31:10,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:31:10,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:31:10,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:31:10,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:31:10,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-17 18:31:10,318 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-17 18:31:10,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:31:10,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-17 18:31:10,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:31:10,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:31:10,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:31:10,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:31:10,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:31:10,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:31:10,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:31:10,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:31:10,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:31:10,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:31:10,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:31:10,331 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-17 18:31:10,331 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-17 18:31:10,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:31:10,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:31:10,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:31:10,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:31:10,332 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-17 18:31:10,332 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-17 18:31:10,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:31:10,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:31:10,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:31:10,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:31:10,665 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:31:10,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/lcp.c [2024-09-17 18:31:12,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:31:12,357 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:31:12,358 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/lcp.c [2024-09-17 18:31:12,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4a19192f4/25cae9e2e3e24a0285a99869903ece4c/FLAGf659f70b6 [2024-09-17 18:31:12,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4a19192f4/25cae9e2e3e24a0285a99869903ece4c [2024-09-17 18:31:12,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:31:12,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:31:12,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:12,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:31:12,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:31:12,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f04de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12, skipping insertion in model container [2024-09-17 18:31:12,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:31:12,580 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-17 18:31:12,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:12,621 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:31:12,635 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-17 18:31:12,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:12,674 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:31:12,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12 WrapperNode [2024-09-17 18:31:12,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:12,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:12,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:31:12,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:31:12,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,705 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:31:12,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:12,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:31:12,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:31:12,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:31:12,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,751 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-17 18:31:12,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:31:12,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:31:12,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:31:12,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:31:12,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (1/1) ... [2024-09-17 18:31:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:31:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:31:12,814 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-17 18:31:12,817 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-17 18:31:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:31:12,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-17 18:31:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-17 18:31:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-09-17 18:31:12,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 18:31:12,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 18:31:12,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:31:12,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:31:12,873 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-17 18:31:12,873 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-17 18:31:12,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:31:12,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:31:12,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-17 18:31:12,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-17 18:31:12,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-17 18:31:12,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-09-17 18:31:12,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcp [2024-09-17 18:31:12,874 INFO L138 BoogieDeclarations]: Found implementation of procedure lcp [2024-09-17 18:31:12,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:31:12,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:31:12,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-17 18:31:12,875 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-17 18:31:12,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:31:12,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:31:12,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 18:31:12,987 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:31:12,991 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:31:13,256 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-09-17 18:31:13,256 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:31:13,285 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:31:13,285 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-17 18:31:13,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:13 BoogieIcfgContainer [2024-09-17 18:31:13,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:31:13,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:31:13,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:31:13,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:31:13,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:31:12" (1/3) ... [2024-09-17 18:31:13,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb6a79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:13, skipping insertion in model container [2024-09-17 18:31:13,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:12" (2/3) ... [2024-09-17 18:31:13,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb6a79a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:13, skipping insertion in model container [2024-09-17 18:31:13,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:13" (3/3) ... [2024-09-17 18:31:13,294 INFO L112 eAbstractionObserver]: Analyzing ICFG lcp.c [2024-09-17 18:31:13,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:31:13,312 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:31:13,374 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:31:13,383 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;@5596b1bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:31:13,384 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:31:13,388 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-17 18:31:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-17 18:31:13,398 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:13,399 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-17 18:31:13,400 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:13,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash 384185568, now seen corresponding path program 1 times [2024-09-17 18:31:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:13,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264721458] [2024-09-17 18:31:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:13,421 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-17 18:31:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:13,425 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-17 18:31:13,426 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-17 18:31:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:13,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-17 18:31:13,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:13,601 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-17 18:31:13,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:31:13,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264721458] [2024-09-17 18:31:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264721458] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 18:31:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520807728] [2024-09-17 18:31:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:13,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 18:31:13,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 18:31:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 18:31:13,635 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-17 18:31:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:13,673 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2024-09-17 18:31:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 18:31:13,676 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-17 18:31:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:13,683 INFO L225 Difference]: With dead ends: 82 [2024-09-17 18:31:13,684 INFO L226 Difference]: Without dead ends: 38 [2024-09-17 18:31:13,688 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-17 18:31:13,693 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-17 18:31:13,693 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-17 18:31:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-17 18:31:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-17 18:31:13,732 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-17 18:31:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-17 18:31:13,737 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 38 [2024-09-17 18:31:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:13,738 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-17 18:31:13,739 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-17 18:31:13,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-17 18:31:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-17 18:31:13,742 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:13,742 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-17 18:31:13,747 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-17 18:31:13,943 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-17 18:31:13,943 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:13,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 96317513, now seen corresponding path program 1 times [2024-09-17 18:31:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309630579] [2024-09-17 18:31:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:13,945 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-17 18:31:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:13,948 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-17 18:31:13,951 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-17 18:31:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:14,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-17 18:31:14,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:14,270 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-17 18:31:14,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:31:14,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:14,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309630579] [2024-09-17 18:31:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309630579] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:14,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:14,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-17 18:31:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714072162] [2024-09-17 18:31:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:14,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-17 18:31:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:14,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-17 18:31:14,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:31:14,279 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-17 18:31:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:14,456 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-17 18:31:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-17 18:31:14,457 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-17 18:31:14,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:14,458 INFO L225 Difference]: With dead ends: 58 [2024-09-17 18:31:14,459 INFO L226 Difference]: Without dead ends: 41 [2024-09-17 18:31:14,459 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-17 18:31:14,460 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-17 18:31:14,461 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-17 18:31:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-17 18:31:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-17 18:31:14,469 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-17 18:31:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-17 18:31:14,474 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 40 [2024-09-17 18:31:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:14,475 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-17 18:31:14,476 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-17 18:31:14,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-17 18:31:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-17 18:31:14,479 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:14,480 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-17 18:31:14,485 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-17 18:31:14,681 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-17 18:31:14,682 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:14,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash 46925806, now seen corresponding path program 1 times [2024-09-17 18:31:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131336187] [2024-09-17 18:31:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:14,684 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-17 18:31:14,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:14,685 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-17 18:31:14,686 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-17 18:31:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:14,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-17 18:31:14,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:15,707 INFO L349 Elim1Store]: treesize reduction 70, result has 9.1 percent of original size [2024-09-17 18:31:15,708 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-17 18:31:15,824 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-17 18:31:15,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:31:24,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131336187] [2024-09-17 18:31:24,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131336187] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:31:24,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [158309802] [2024-09-17 18:31:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:24,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-17 18:31:24,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-17 18:31:24,210 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-17 18:31:24,211 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-17 18:31:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:24,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-17 18:31:24,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:24,407 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-17 18:31:28,596 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-17 18:31:32,702 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-17 18:31:45,537 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-17 18:31:45,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:31:57,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [158309802] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:31:57,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:31:57,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2024-09-17 18:31:57,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944041295] [2024-09-17 18:31:57,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:31:57,826 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-17 18:31:57,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-17 18:31:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=801, Unknown=10, NotChecked=114, Total=992 [2024-09-17 18:31:57,828 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-17 18:32:42,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 18:32:47,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 18:33:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:33:46,151 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-09-17 18:33:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-17 18:33:46,152 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-17 18:33:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:33:46,155 INFO L225 Difference]: With dead ends: 89 [2024-09-17 18:33:46,155 INFO L226 Difference]: Without dead ends: 66 [2024-09-17 18:33:46,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 141.3s TimeCoverageRelationStatistics Valid=254, Invalid=2916, Unknown=30, NotChecked=222, Total=3422 [2024-09-17 18:33:46,158 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 82 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.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, 8.9s IncrementalHoareTripleChecker+Time [2024-09-17 18:33:46,158 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 385 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 620 Invalid, 1 Unknown, 149 Unchecked, 8.9s Time] [2024-09-17 18:33:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-17 18:33:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-09-17 18:33:46,176 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-17 18:33:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-09-17 18:33:46,177 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 43 [2024-09-17 18:33:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:33:46,178 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-09-17 18:33:46,178 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-17 18:33:46,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:33:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-09-17 18:33:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-17 18:33:46,180 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:33:46,180 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-17 18:33:46,187 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-17 18:33:46,384 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-09-17 18:33:46,580 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-17 18:33:46,581 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:33:46,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:33:46,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1935896750, now seen corresponding path program 1 times [2024-09-17 18:33:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:33:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260834242] [2024-09-17 18:33:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:33:46,583 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-17 18:33:46,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:33:46,595 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-17 18:33:46,596 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-17 18:33:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:33:46,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-09-17 18:33:46,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:33:46,655 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-17 18:33:46,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:33:46,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:33:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260834242] [2024-09-17 18:33:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260834242] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:33:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:33:46,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 18:33:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697879128] [2024-09-17 18:33:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:33:46,657 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 18:33:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:33:46,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 18:33:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:33:46,658 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-17 18:33:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:33:46,703 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-09-17 18:33:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 18:33:46,704 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-17 18:33:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:33:46,706 INFO L225 Difference]: With dead ends: 87 [2024-09-17 18:33:46,707 INFO L226 Difference]: Without dead ends: 61 [2024-09-17 18:33:46,707 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-17 18:33:46,708 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-17 18:33:46,708 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-17 18:33:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-17 18:33:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-09-17 18:33:46,727 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-17 18:33:46,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-09-17 18:33:46,730 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 43 [2024-09-17 18:33:46,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:33:46,731 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-09-17 18:33:46,732 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-17 18:33:46,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:33:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-09-17 18:33:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-17 18:33:46,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:33:46,735 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-17 18:33:46,741 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-17 18:33:46,936 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-17 18:33:46,937 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:33:46,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:33:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 204017195, now seen corresponding path program 1 times [2024-09-17 18:33:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:33:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87443551] [2024-09-17 18:33:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:33:46,938 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-17 18:33:46,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:33:46,940 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-17 18:33:46,941 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-17 18:33:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:33:47,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-17 18:33:47,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:33:51,441 INFO L349 Elim1Store]: treesize reduction 104, result has 39.9 percent of original size [2024-09-17 18:33:51,441 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-17 18:33:51,880 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-17 18:33:51,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:34:00,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:34:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87443551] [2024-09-17 18:34:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87443551] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:34:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1897731235] [2024-09-17 18:34:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:34:00,571 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-17 18:34:00,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-17 18:34:00,573 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-17 18:34:00,574 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-17 18:34:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:34:00,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-17 18:34:00,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:34:00,678 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-17 18:34:05,011 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-17 18:34:09,183 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-17 18:34:13,675 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-17 18:34:13,837 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-17 18:34:14,047 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-17 18:34:14,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:34:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1897731235] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:34:50,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:34:50,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-17 18:34:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111994592] [2024-09-17 18:34:50,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:34:50,812 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-17 18:34:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:34:50,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-17 18:34:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1103, Unknown=14, NotChecked=204, Total=1406 [2024-09-17 18:34:50,816 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-17 18:35:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:35:30,205 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-09-17 18:35:30,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-17 18:35:30,207 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-17 18:35:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:35:30,208 INFO L225 Difference]: With dead ends: 87 [2024-09-17 18:35:30,208 INFO L226 Difference]: Without dead ends: 83 [2024-09-17 18:35:30,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 97.0s TimeCoverageRelationStatistics Valid=224, Invalid=2959, Unknown=21, NotChecked=336, Total=3540 [2024-09-17 18:35:30,211 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.7s IncrementalHoareTripleChecker+Time [2024-09-17 18:35:30,213 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 507 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1058 Invalid, 0 Unknown, 477 Unchecked, 3.7s Time] [2024-09-17 18:35:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-17 18:35:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2024-09-17 18:35:30,238 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-17 18:35:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-17 18:35:30,240 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2024-09-17 18:35:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:35:30,241 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-17 18:35:30,241 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-17 18:35:30,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:35:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-17 18:35:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-17 18:35:30,244 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:35:30,244 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-17 18:35:30,250 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-17 18:35:30,449 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-09-17 18:35:30,645 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-17 18:35:30,646 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:35:30,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:35:30,648 INFO L85 PathProgramCache]: Analyzing trace with hash 270624175, now seen corresponding path program 1 times [2024-09-17 18:35:30,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:35:30,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651820496] [2024-09-17 18:35:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:35:30,649 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-17 18:35:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:35:30,651 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-17 18:35:30,652 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-17 18:35:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:35:30,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-17 18:35:30,888 INFO L285 TraceCheckSpWp]: Computing forward predicates...