./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.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 e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.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 ac50e78a0e7740f8f8502d719fb62ad334aab86379189891d467b39f2a3c9d3d --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.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:16:36,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:16:36,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:16:36,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:16:36,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:16:36,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:16:36,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:16:36,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:16:36,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:16:36,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:16:36,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:16:36,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:16:36,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:16:36,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:16:36,204 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:16:36,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:16:36,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:16:36,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:16:36,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:16:36,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:16:36,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:16:36,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:16:36,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:16:36,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:16:36,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:16:36,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:16:36,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:16:36,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:16:36,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:16:36,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:16:36,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:16:36,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:16:36,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:16:36,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:16:36,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:16:36,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:16:36,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:16:36,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:16:36,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:16:36,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:16:36,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:16:36,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:16:36,217 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 -> ac50e78a0e7740f8f8502d719fb62ad334aab86379189891d467b39f2a3c9d3d 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-10-15 14:16:36,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:16:36,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:16:36,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:16:36,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:16:36,555 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:16:36,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2024-10-15 14:16:37,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:16:38,133 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:16:38,134 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2024-10-15 14:16:38,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a8938283e/16eeb60fdea14549bf518191088e504f/FLAGae49c52d6 [2024-10-15 14:16:38,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a8938283e/16eeb60fdea14549bf518191088e504f [2024-10-15 14:16:38,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:16:38,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:16:38,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:16:38,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:16:38,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:16:38,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5bfa15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38, skipping insertion in model container [2024-10-15 14:16:38,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:16:38,376 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2024-10-15 14:16:38,388 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2024-10-15 14:16:38,391 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2024-10-15 14:16:38,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:16:38,404 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:16:38,424 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1215,1228] [2024-10-15 14:16:38,432 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[1969,1982] [2024-10-15 14:16:38,435 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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c[2504,2517] [2024-10-15 14:16:38,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:16:38,453 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:16:38,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38 WrapperNode [2024-10-15 14:16:38,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:16:38,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:16:38,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:16:38,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:16:38,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,474 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:16:38,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:16:38,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:16:38,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:16:38,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:16:38,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,500 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-15 14:16:38,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:16:38,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:16:38,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:16:38,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:16:38,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (1/1) ... [2024-10-15 14:16:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:16:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:16:38,550 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-10-15 14:16:38,553 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-10-15 14:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:16:38,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 14:16:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 14:16:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 14:16:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:16:38,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:16:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:16:38,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:16:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 14:16:38,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 14:16:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 14:16:38,687 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:16:38,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:16:39,038 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-15 14:16:39,038 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:16:39,061 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:16:39,061 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-15 14:16:39,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:16:39 BoogieIcfgContainer [2024-10-15 14:16:39,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:16:39,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:16:39,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:16:39,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:16:39,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:16:38" (1/3) ... [2024-10-15 14:16:39,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3202ed21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:16:39, skipping insertion in model container [2024-10-15 14:16:39,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:16:38" (2/3) ... [2024-10-15 14:16:39,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3202ed21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:16:39, skipping insertion in model container [2024-10-15 14:16:39,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:16:39" (3/3) ... [2024-10-15 14:16:39,073 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2024-10-15 14:16:39,088 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:16:39,089 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-15 14:16:39,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:16:39,152 INFO L333 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;@490d126d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:16:39,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-15 14:16:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 32 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:16:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:16:39,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:39,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:39,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:39,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 109718277, now seen corresponding path program 1 times [2024-10-15 14:16:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453004281] [2024-10-15 14:16:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:39,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:39,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453004281] [2024-10-15 14:16:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453004281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:16:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272601641] [2024-10-15 14:16:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:39,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:16:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:16:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:16:39,419 INFO L87 Difference]: Start difference. First operand has 37 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 32 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:39,571 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2024-10-15 14:16:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:16:39,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-15 14:16:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:39,581 INFO L225 Difference]: With dead ends: 76 [2024-10-15 14:16:39,581 INFO L226 Difference]: Without dead ends: 37 [2024-10-15 14:16:39,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-15 14:16:39,587 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:39,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 21 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-15 14:16:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2024-10-15 14:16:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-15 14:16:39,623 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 14 [2024-10-15 14:16:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-15 14:16:39,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-15 14:16:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:16:39,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:39,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:39,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:16:39,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:39,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1930456833, now seen corresponding path program 1 times [2024-10-15 14:16:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723094710] [2024-10-15 14:16:39,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723094710] [2024-10-15 14:16:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723094710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:39,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:16:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178707309] [2024-10-15 14:16:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:39,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:16:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:16:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:16:39,811 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:39,930 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2024-10-15 14:16:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 14:16:39,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-15 14:16:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:39,932 INFO L225 Difference]: With dead ends: 64 [2024-10-15 14:16:39,933 INFO L226 Difference]: Without dead ends: 38 [2024-10-15 14:16:39,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:16:39,935 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:39,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-15 14:16:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2024-10-15 14:16:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 29 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-15 14:16:39,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 14 [2024-10-15 14:16:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:39,952 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-15 14:16:39,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:39,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-15 14:16:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:16:39,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:39,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:39,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:16:39,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:39,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1841004945, now seen corresponding path program 1 times [2024-10-15 14:16:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121706764] [2024-10-15 14:16:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121706764] [2024-10-15 14:16:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121706764] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:16:40,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151555574] [2024-10-15 14:16:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:16:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:16:40,165 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-10-15 14:16:40,167 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:16:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 14:16:40,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:16:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:40,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:16:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:40,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151555574] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-15 14:16:40,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:16:40,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-10-15 14:16:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744833225] [2024-10-15 14:16:40,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:40,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:16:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:16:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:16:40,391 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:40,412 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-10-15 14:16:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:16:40,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-15 14:16:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:40,413 INFO L225 Difference]: With dead ends: 40 [2024-10-15 14:16:40,413 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 14:16:40,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:16:40,415 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:40,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:16:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 14:16:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-15 14:16:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-15 14:16:40,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 15 [2024-10-15 14:16:40,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:40,430 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-15 14:16:40,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:40,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-15 14:16:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:16:40,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:40,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:40,451 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:16:40,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:16:40,638 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1017837573, now seen corresponding path program 1 times [2024-10-15 14:16:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134463990] [2024-10-15 14:16:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 14:16:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134463990] [2024-10-15 14:16:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134463990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:40,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:16:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261068070] [2024-10-15 14:16:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:16:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:16:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:16:40,712 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:40,805 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2024-10-15 14:16:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:16:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-15 14:16:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:40,807 INFO L225 Difference]: With dead ends: 60 [2024-10-15 14:16:40,807 INFO L226 Difference]: Without dead ends: 40 [2024-10-15 14:16:40,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:16:40,809 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:40,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-15 14:16:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-10-15 14:16:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-15 14:16:40,822 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2024-10-15 14:16:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:40,822 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-15 14:16:40,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-15 14:16:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-15 14:16:40,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:40,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:16:40,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash 954114624, now seen corresponding path program 1 times [2024-10-15 14:16:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:40,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95863488] [2024-10-15 14:16:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 14:16:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95863488] [2024-10-15 14:16:40,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95863488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:40,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:40,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 14:16:40,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389360389] [2024-10-15 14:16:40,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:40,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 14:16:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 14:16:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:16:40,930 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:41,038 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-15 14:16:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:16:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-15 14:16:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:41,041 INFO L225 Difference]: With dead ends: 37 [2024-10-15 14:16:41,041 INFO L226 Difference]: Without dead ends: 35 [2024-10-15 14:16:41,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:16:41,042 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:41,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 64 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-15 14:16:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-15 14:16:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-15 14:16:41,056 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 16 [2024-10-15 14:16:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:41,057 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-15 14:16:41,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-15 14:16:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-15 14:16:41,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:41,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:41,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-15 14:16:41,062 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash -430021882, now seen corresponding path program 1 times [2024-10-15 14:16:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026161594] [2024-10-15 14:16:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 14:16:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:41,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026161594] [2024-10-15 14:16:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026161594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 14:16:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650115499] [2024-10-15 14:16:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-15 14:16:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 14:16:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 14:16:41,117 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:41,191 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2024-10-15 14:16:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 14:16:41,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-15 14:16:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:41,193 INFO L225 Difference]: With dead ends: 56 [2024-10-15 14:16:41,193 INFO L226 Difference]: Without dead ends: 36 [2024-10-15 14:16:41,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-15 14:16:41,195 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:41,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-15 14:16:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2024-10-15 14:16:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-15 14:16:41,206 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2024-10-15 14:16:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:41,206 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-15 14:16:41,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-15 14:16:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-15 14:16:41,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:41,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:41,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-15 14:16:41,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:41,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:41,209 INFO L85 PathProgramCache]: Analyzing trace with hash -453604801, now seen corresponding path program 1 times [2024-10-15 14:16:41,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:41,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565341945] [2024-10-15 14:16:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565341945] [2024-10-15 14:16:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565341945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:16:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689512556] [2024-10-15 14:16:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:41,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:16:41,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:16:41,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:16:41,344 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:16:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 14:16:41,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:16:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:41,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:16:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689512556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:16:41,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:16:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-10-15 14:16:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141432769] [2024-10-15 14:16:41,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:16:41,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-15 14:16:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-15 14:16:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-15 14:16:41,467 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:41,583 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-15 14:16:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:16:41,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-15 14:16:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:41,584 INFO L225 Difference]: With dead ends: 56 [2024-10-15 14:16:41,584 INFO L226 Difference]: Without dead ends: 33 [2024-10-15 14:16:41,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-15 14:16:41,585 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:41,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 64 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-15 14:16:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-15 14:16:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-10-15 14:16:41,599 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2024-10-15 14:16:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:41,599 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-10-15 14:16:41,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:41,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-10-15 14:16:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-15 14:16:41,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:41,601 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:41,620 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 14:16:41,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:16:41,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1877285295, now seen corresponding path program 2 times [2024-10-15 14:16:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180412618] [2024-10-15 14:16:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:16:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180412618] [2024-10-15 14:16:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180412618] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:16:41,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616002384] [2024-10-15 14:16:41,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:16:41,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:16:41,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:16:41,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:16:41,974 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:16:42,081 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-15 14:16:42,081 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:16:42,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-15 14:16:42,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:16:43,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 14:16:43,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 14:16:43,746 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-15 14:16:43,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 14:16:43,752 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-15 14:16:43,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-15 14:16:43,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 14:16:43,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 465 treesize of output 255 [2024-10-15 14:16:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 14:16:44,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 14:16:44,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616002384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:44,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 14:16:44,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-10-15 14:16:44,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81933113] [2024-10-15 14:16:44,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:44,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:16:44,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:44,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:16:44,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-15 14:16:44,192 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:44,413 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-10-15 14:16:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 14:16:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-15 14:16:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:44,414 INFO L225 Difference]: With dead ends: 48 [2024-10-15 14:16:44,414 INFO L226 Difference]: Without dead ends: 29 [2024-10-15 14:16:44,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-15 14:16:44,416 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:44,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 48 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 14:16:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-15 14:16:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-15 14:16:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-15 14:16:44,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2024-10-15 14:16:44,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:44,428 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-15 14:16:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:44,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-15 14:16:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-15 14:16:44,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:16:44,429 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:44,445 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:16:44,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-15 14:16:44,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:16:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1709447332, now seen corresponding path program 1 times [2024-10-15 14:16:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:16:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044775244] [2024-10-15 14:16:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:16:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:16:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:16:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:16:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 14:16:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:16:44,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044775244] [2024-10-15 14:16:44,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044775244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:16:44,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:16:44,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-15 14:16:44,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642328729] [2024-10-15 14:16:44,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:16:44,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:16:44,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:16:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:16:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:16:44,743 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:16:44,824 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-15 14:16:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 14:16:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-15 14:16:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:16:44,825 INFO L225 Difference]: With dead ends: 27 [2024-10-15 14:16:44,825 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:16:44,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:16:44,826 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:16:44,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:16:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:16:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:16:44,828 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-10-15 14:16:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:16:44,828 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-10-15 14:16:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:16:44,828 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:16:44,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:16:44,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:16:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:16:44,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:16:44,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-15 14:16:44,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-15 14:16:44,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-15 14:16:44,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-15 14:16:44,838 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:16:44,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:16:45,218 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:16:45,229 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 14:16:45,230 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 14:16:45,230 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-10-15 14:16:45,230 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 14:16:45,231 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 14:16:45,231 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-10-15 14:16:45,231 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,233 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,234 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,235 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 14:16:45,235 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 14:16:45,235 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-10-15 14:16:45,235 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 14:16:45,235 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 14:16:45,235 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-10-15 14:16:45,236 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,236 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 14:16:45,236 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 14:16:45,236 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-10-15 14:16:45,236 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 14:16:45,237 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 14:16:45,237 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-10-15 14:16:45,237 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,240 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,241 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset [2024-10-15 14:16:45,243 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) Eliminated clause: true [2024-10-15 14:16:45,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:16:45 BoogieIcfgContainer [2024-10-15 14:16:45,249 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:16:45,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:16:45,250 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:16:45,250 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:16:45,250 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:16:39" (3/4) ... [2024-10-15 14:16:45,251 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:16:45,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:16:45,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:16:45,315 INFO L158 Benchmark]: Toolchain (without parser) took 7155.87ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 138.2MB in the beginning and 126.6MB in the end (delta: 11.6MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,315 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:16:45,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.61ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 124.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.48ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 122.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,316 INFO L158 Benchmark]: Boogie Preprocessor took 39.52ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,316 INFO L158 Benchmark]: RCFGBuilder took 546.09ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 130.5MB in the end (delta: -9.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,317 INFO L158 Benchmark]: TraceAbstraction took 6185.86ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 129.9MB in the beginning and 129.7MB in the end (delta: 179.6kB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,317 INFO L158 Benchmark]: Witness Printer took 64.96ms. Allocated memory is still 247.5MB. Free memory was 129.7MB in the beginning and 126.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:16:45,318 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.18ms. Allocated memory is still 109.1MB. Free memory is still 80.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.61ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 124.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.48ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 122.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.52ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.09ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 130.5MB in the end (delta: -9.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6185.86ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 129.9MB in the beginning and 129.7MB in the end (delta: 179.6kB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. * Witness Printer took 64.96ms. Allocated memory is still 247.5MB. Free memory was 129.7MB in the beginning and 126.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#main__array~0!offset * 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: 46]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 77]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 114]: 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 3 procedures, 37 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 176 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 9 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 227 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 784 SizeOfPredicates, 5 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 24/39 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 3 specifications checked. All of them hold - InvariantResult [Line: 102]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 102]: Location Invariant Derived location invariant: ((((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) || (main__loop_entered == 0)) - InvariantResult [Line: 33]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((((__tmp_155_0 == \old(__tmp_155_0)) && (main____CPAchecker_TMP_0 == 1)) && (main__loop_entered == 0)) && (((long long) main__index1 + 1) <= main__index2)) && (main__index2 <= 99999)) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((__tmp_155_0 == \old(__tmp_155_0)) && (main__loop_entered == 0)) - InvariantResult [Line: 66]: Location Invariant Derived location invariant: ((((main____CPAchecker_TMP_0 != 0) && ((((long long) main__index2 + 1) % 4294967296) <= 99999)) && (((long long) main__index1 + 1) <= main__index2)) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - InvariantResult [Line: 105]: Location Invariant Derived location invariant: ((((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) || ((((long long) main__index1 + 1) <= main__index2) && (main__index2 <= 99999))) - InvariantResult [Line: 50]: Location Invariant Derived location invariant: ((((long long) main__index1 + 1) <= main__index2) && (main__index2 <= 99999)) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main. Ensures: ((__return_main == \old(__return_main)) && (__return_136 == \old(__return_136))) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:16:45,351 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 Writing output log to file Ultimate.log Result: TRUE