./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-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 2f03a9521f9986f7627623e3bf6c079dbfbe3dc9d9c229ed8d14a2828a7d6850 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 18:00:44,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 18:00:44,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 18:00:44,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 18:00:44,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 18:00:44,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 18:00:44,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 18:00:44,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 18:00:44,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 18:00:44,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 18:00:44,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 18:00:44,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 18:00:44,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 18:00:44,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 18:00:44,382 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 18:00:44,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 18:00:44,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 18:00:44,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 18:00:44,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 18:00:44,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 18:00:44,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 18:00:44,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 18:00:44,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 18:00:44,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 18:00:44,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 18:00:44,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 18:00:44,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 18:00:44,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 18:00:44,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 18:00:44,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 18:00:44,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 18:00:44,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 18:00:44,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:00:44,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 18:00:44,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 18:00:44,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 18:00:44,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 18:00:44,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 18:00:44,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 18:00:44,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 18:00:44,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 18:00:44,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 18:00:44,397 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 -> 2f03a9521f9986f7627623e3bf6c079dbfbe3dc9d9c229ed8d14a2828a7d6850 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.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 18:00:44,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 18:00:44,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 18:00:44,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 18:00:44,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 18:00:44,781 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 18:00:44,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-09-12 18:00:46,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 18:00:46,548 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 18:00:46,549 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c [2024-09-12 18:00:46,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/68cb1b45f/018e855f70624319bcb773d28a906d85/FLAGebd4a5991 [2024-09-12 18:00:46,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/68cb1b45f/018e855f70624319bcb773d28a906d85 [2024-09-12 18:00:46,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 18:00:46,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 18:00:46,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 18:00:46,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 18:00:46,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 18:00:46,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:00:46" (1/1) ... [2024-09-12 18:00:46,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273296a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:46, skipping insertion in model container [2024-09-12 18:00:46,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 06:00:46" (1/1) ... [2024-09-12 18:00:46,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 18:00:47,131 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c[854,867] [2024-09-12 18:00:47,137 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c[1096,1109] [2024-09-12 18:00:47,143 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c[1375,1388] [2024-09-12 18:00:47,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:00:47,169 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 18:00:47,184 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c[854,867] [2024-09-12 18:00:47,188 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c[1096,1109] [2024-09-12 18:00:47,191 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/id_build.i.v+lhb-reducer.c[1375,1388] [2024-09-12 18:00:47,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 18:00:47,219 INFO L204 MainTranslator]: Completed translation [2024-09-12 18:00:47,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47 WrapperNode [2024-09-12 18:00:47,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 18:00:47,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 18:00:47,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 18:00:47,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 18:00:47,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,249 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 18:00:47,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 18:00:47,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 18:00:47,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 18:00:47,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 18:00:47,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,293 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 18:00:47,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 18:00:47,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 18:00:47,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 18:00:47,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 18:00:47,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (1/1) ... [2024-09-12 18:00:47,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 18:00:47,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:47,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 18:00:47,368 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 18:00:47,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 18:00:47,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 18:00:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 18:00:47,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 18:00:47,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 18:00:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 18:00:47,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 18:00:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 18:00:47,486 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 18:00:47,489 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 18:00:47,768 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-09-12 18:00:47,772 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 18:00:47,803 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 18:00:47,804 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 18:00:47,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:00:47 BoogieIcfgContainer [2024-09-12 18:00:47,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 18:00:47,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 18:00:47,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 18:00:47,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 18:00:47,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 06:00:46" (1/3) ... [2024-09-12 18:00:47,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3519fd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:00:47, skipping insertion in model container [2024-09-12 18:00:47,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 06:00:47" (2/3) ... [2024-09-12 18:00:47,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3519fd57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 06:00:47, skipping insertion in model container [2024-09-12 18:00:47,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:00:47" (3/3) ... [2024-09-12 18:00:47,814 INFO L112 eAbstractionObserver]: Analyzing ICFG id_build.i.v+lhb-reducer.c [2024-09-12 18:00:47,832 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 18:00:47,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-09-12 18:00:47,890 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 18:00:47,897 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e24db14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 18:00:47,897 INFO L337 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-09-12 18:00:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 54 states have internal predecessors, (61), 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-09-12 18:00:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 18:00:47,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:47,912 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:47,913 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:47,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1863696843, now seen corresponding path program 1 times [2024-09-12 18:00:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:47,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155402008] [2024-09-12 18:00:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:48,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:48,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:48,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155402008] [2024-09-12 18:00:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155402008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:48,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:48,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:00:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188916743] [2024-09-12 18:00:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:48,160 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:00:48,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:00:48,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:48,203 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 54 states have internal predecessors, (61), 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 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-09-12 18:00:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:48,531 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2024-09-12 18:00:48,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:00:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 8 [2024-09-12 18:00:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:48,542 INFO L225 Difference]: With dead ends: 108 [2024-09-12 18:00:48,543 INFO L226 Difference]: Without dead ends: 88 [2024-09-12 18:00:48,549 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:00:48,554 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 202 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:48,557 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 15 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:00:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-12 18:00:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2024-09-12 18:00:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 73 states have internal predecessors, (89), 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-09-12 18:00:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-09-12 18:00:48,626 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 8 [2024-09-12 18:00:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:48,627 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-09-12 18:00:48,627 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-09-12 18:00:48,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-09-12 18:00:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-12 18:00:48,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:48,629 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:48,629 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 18:00:48,629 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:48,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1940027331, now seen corresponding path program 1 times [2024-09-12 18:00:48,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:48,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395828511] [2024-09-12 18:00:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:48,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395828511] [2024-09-12 18:00:48,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395828511] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:48,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:00:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394547177] [2024-09-12 18:00:48,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:48,712 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:00:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:00:48,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:00:48,714 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09-12 18:00:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:48,838 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2024-09-12 18:00:48,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:00:48,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 9 [2024-09-12 18:00:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:48,849 INFO L225 Difference]: With dead ends: 77 [2024-09-12 18:00:48,849 INFO L226 Difference]: Without dead ends: 74 [2024-09-12 18:00:48,850 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:48,851 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 84 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:48,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 7 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-12 18:00:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-09-12 18:00:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 70 states have internal predecessors, (83), 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-09-12 18:00:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-09-12 18:00:48,876 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 9 [2024-09-12 18:00:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:48,876 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-09-12 18:00:48,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09-12 18:00:48,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-09-12 18:00:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 18:00:48,878 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:48,878 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:48,879 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 18:00:48,879 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:48,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 350460165, now seen corresponding path program 1 times [2024-09-12 18:00:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:48,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042686925] [2024-09-12 18:00:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:48,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:48,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042686925] [2024-09-12 18:00:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042686925] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 18:00:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129278521] [2024-09-12 18:00:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:48,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:00:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:48,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:00:48,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:00:48,984 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-09-12 18:00:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:49,149 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-09-12 18:00:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:00:49,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 11 [2024-09-12 18:00:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:49,151 INFO L225 Difference]: With dead ends: 85 [2024-09-12 18:00:49,151 INFO L226 Difference]: Without dead ends: 82 [2024-09-12 18:00:49,151 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:49,153 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:49,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 7 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-12 18:00:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2024-09-12 18:00:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 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-09-12 18:00:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-09-12 18:00:49,188 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 11 [2024-09-12 18:00:49,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:49,189 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-09-12 18:00:49,189 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-09-12 18:00:49,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-09-12 18:00:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 18:00:49,190 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:49,190 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:49,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 18:00:49,190 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:49,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash -127365946, now seen corresponding path program 1 times [2024-09-12 18:00:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367757785] [2024-09-12 18:00:49,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:49,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:49,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 18:00:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367757785] [2024-09-12 18:00:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367757785] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:49,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 18:00:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153511314] [2024-09-12 18:00:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:49,263 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:00:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:00:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 18:00:49,264 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09-12 18:00:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:49,417 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-09-12 18:00:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:00:49,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2024-09-12 18:00:49,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:49,418 INFO L225 Difference]: With dead ends: 135 [2024-09-12 18:00:49,418 INFO L226 Difference]: Without dead ends: 89 [2024-09-12 18:00:49,419 INFO L433 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-09-12 18:00:49,420 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 83 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:49,423 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 7 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-12 18:00:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-09-12 18:00:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 77 states have internal predecessors, (91), 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-09-12 18:00:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2024-09-12 18:00:49,452 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 12 [2024-09-12 18:00:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:49,452 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2024-09-12 18:00:49,452 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09-12 18:00:49,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2024-09-12 18:00:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-12 18:00:49,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:49,454 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:49,455 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 18:00:49,455 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:49,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1784771175, now seen corresponding path program 1 times [2024-09-12 18:00:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41598722] [2024-09-12 18:00:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:49,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41598722] [2024-09-12 18:00:49,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41598722] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:49,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:49,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:00:49,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497760045] [2024-09-12 18:00:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:49,609 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:00:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:00:49,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:49,613 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09-12 18:00:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:49,733 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2024-09-12 18:00:49,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:00:49,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2024-09-12 18:00:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:49,735 INFO L225 Difference]: With dead ends: 81 [2024-09-12 18:00:49,736 INFO L226 Difference]: Without dead ends: 77 [2024-09-12 18:00:49,736 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-09-12 18:00:49,737 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:49,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 10 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-12 18:00:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-09-12 18:00:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 73 states have internal predecessors, (85), 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-09-12 18:00:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2024-09-12 18:00:49,770 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 13 [2024-09-12 18:00:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:49,773 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2024-09-12 18:00:49,774 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09-12 18:00:49,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-09-12 18:00:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 18:00:49,775 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:49,775 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:49,775 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 18:00:49,775 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:49,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1827049517, now seen corresponding path program 1 times [2024-09-12 18:00:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:49,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975658752] [2024-09-12 18:00:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:49,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975658752] [2024-09-12 18:00:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975658752] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:00:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588074586] [2024-09-12 18:00:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:49,917 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:00:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:00:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:49,919 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-09-12 18:00:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:50,011 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2024-09-12 18:00:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:00:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 19 [2024-09-12 18:00:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:50,013 INFO L225 Difference]: With dead ends: 77 [2024-09-12 18:00:50,013 INFO L226 Difference]: Without dead ends: 74 [2024-09-12 18:00:50,013 INFO L433 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-09-12 18:00:50,014 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:50,014 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 10 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-12 18:00:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-09-12 18:00:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 70 states have internal predecessors, (79), 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-09-12 18:00:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-09-12 18:00:50,039 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 19 [2024-09-12 18:00:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:50,040 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-09-12 18:00:50,040 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-09-12 18:00:50,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-09-12 18:00:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 18:00:50,042 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:50,042 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:50,042 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 18:00:50,042 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:50,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1049170167, now seen corresponding path program 1 times [2024-09-12 18:00:50,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:50,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468523545] [2024-09-12 18:00:50,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:50,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468523545] [2024-09-12 18:00:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468523545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:50,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 18:00:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130201458] [2024-09-12 18:00:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:50,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 18:00:50,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:50,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 18:00:50,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:00:50,203 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-09-12 18:00:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:50,343 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-09-12 18:00:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 18:00:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2024-09-12 18:00:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:50,346 INFO L225 Difference]: With dead ends: 74 [2024-09-12 18:00:50,346 INFO L226 Difference]: Without dead ends: 72 [2024-09-12 18:00:50,346 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-09-12 18:00:50,347 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:50,348 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 13 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:50,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-12 18:00:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-09-12 18:00:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.171875) internal successors, (75), 68 states have internal predecessors, (75), 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-09-12 18:00:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-09-12 18:00:50,374 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 27 [2024-09-12 18:00:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:50,375 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-09-12 18:00:50,375 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-09-12 18:00:50,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-09-12 18:00:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 18:00:50,376 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:50,376 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:50,377 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 18:00:50,377 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:50,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -304899728, now seen corresponding path program 1 times [2024-09-12 18:00:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140265060] [2024-09-12 18:00:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:50,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:50,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140265060] [2024-09-12 18:00:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140265060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 18:00:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 18:00:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732981790] [2024-09-12 18:00:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:50,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:00:50,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:00:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:50,450 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-09-12 18:00:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:50,589 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2024-09-12 18:00:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:00:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 29 [2024-09-12 18:00:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:50,591 INFO L225 Difference]: With dead ends: 142 [2024-09-12 18:00:50,591 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 18:00:50,592 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:00:50,593 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 81 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:50,593 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 10 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 18:00:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2024-09-12 18:00:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 96 states have internal predecessors, (107), 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-09-12 18:00:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2024-09-12 18:00:50,621 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 29 [2024-09-12 18:00:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:50,622 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2024-09-12 18:00:50,622 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-09-12 18:00:50,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2024-09-12 18:00:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 18:00:50,624 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:50,624 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:50,626 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 18:00:50,626 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:50,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1202993015, now seen corresponding path program 1 times [2024-09-12 18:00:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:50,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835421210] [2024-09-12 18:00:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:50,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835421210] [2024-09-12 18:00:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835421210] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347197096] [2024-09-12 18:00:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:50,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:50,694 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 18:00:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:50,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:00:50,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:50,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:00:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347197096] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:50,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:00:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-09-12 18:00:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616671082] [2024-09-12 18:00:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:50,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:00:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:50,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:00:50,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:00:50,837 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-09-12 18:00:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:50,884 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2024-09-12 18:00:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:00:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 33 [2024-09-12 18:00:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:50,887 INFO L225 Difference]: With dead ends: 102 [2024-09-12 18:00:50,887 INFO L226 Difference]: Without dead ends: 101 [2024-09-12 18:00:50,887 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 18:00:50,889 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:50,889 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:00:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-12 18:00:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-09-12 18:00:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.1195652173913044) internal successors, (103), 95 states have internal predecessors, (103), 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-09-12 18:00:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2024-09-12 18:00:50,916 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 33 [2024-09-12 18:00:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:50,916 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2024-09-12 18:00:50,916 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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-09-12 18:00:50,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-09-12 18:00:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 18:00:50,918 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:50,918 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:50,935 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 18:00:51,119 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:51,119 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:51,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash -782949414, now seen corresponding path program 1 times [2024-09-12 18:00:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111951520] [2024-09-12 18:00:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:51,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111951520] [2024-09-12 18:00:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111951520] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496399550] [2024-09-12 18:00:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:51,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:51,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:51,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:51,198 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 18:00:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:51,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:00:51,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:51,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:00:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496399550] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:00:51,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:00:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-09-12 18:00:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786430285] [2024-09-12 18:00:51,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:00:51,399 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 18:00:51,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 18:00:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-09-12 18:00:51,400 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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-09-12 18:00:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:51,666 INFO L93 Difference]: Finished difference Result 245 states and 268 transitions. [2024-09-12 18:00:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 18:00:51,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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 43 [2024-09-12 18:00:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:51,668 INFO L225 Difference]: With dead ends: 245 [2024-09-12 18:00:51,668 INFO L226 Difference]: Without dead ends: 194 [2024-09-12 18:00:51,669 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2024-09-12 18:00:51,670 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 162 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:51,670 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 16 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:00:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-09-12 18:00:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2024-09-12 18:00:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 178 states have (on average 1.0842696629213484) internal successors, (193), 180 states have internal predecessors, (193), 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-09-12 18:00:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2024-09-12 18:00:51,704 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 43 [2024-09-12 18:00:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:51,705 INFO L474 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2024-09-12 18:00:51,705 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 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-09-12 18:00:51,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2024-09-12 18:00:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-12 18:00:51,708 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:51,708 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:51,734 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 18:00:51,912 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 18:00:51,913 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:51,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 489586306, now seen corresponding path program 2 times [2024-09-12 18:00:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43525121] [2024-09-12 18:00:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:52,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 26 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:52,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43525121] [2024-09-12 18:00:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43525121] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164327612] [2024-09-12 18:00:52,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:00:52,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:52,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:52,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:52,103 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 18:00:52,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:00:52,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:00:52,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 18:00:52,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 26 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:52,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:00:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 26 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 18:00:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164327612] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:00:52,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:00:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2024-09-12 18:00:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835881621] [2024-09-12 18:00:52,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:00:52,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 18:00:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 18:00:52,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:00:52,502 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 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-09-12 18:00:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:52,810 INFO L93 Difference]: Finished difference Result 347 states and 364 transitions. [2024-09-12 18:00:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 18:00:52,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 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 99 [2024-09-12 18:00:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:52,813 INFO L225 Difference]: With dead ends: 347 [2024-09-12 18:00:52,813 INFO L226 Difference]: Without dead ends: 254 [2024-09-12 18:00:52,814 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2024-09-12 18:00:52,814 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:52,815 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 10 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 18:00:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-09-12 18:00:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 240. [2024-09-12 18:00:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 234 states have (on average 1.0811965811965811) internal successors, (253), 236 states have internal predecessors, (253), 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-09-12 18:00:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 256 transitions. [2024-09-12 18:00:52,850 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 256 transitions. Word has length 99 [2024-09-12 18:00:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:52,851 INFO L474 AbstractCegarLoop]: Abstraction has 240 states and 256 transitions. [2024-09-12 18:00:52,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 11 states have internal predecessors, (134), 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-09-12 18:00:52,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 256 transitions. [2024-09-12 18:00:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-09-12 18:00:52,853 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:52,853 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:52,872 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 18:00:53,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-12 18:00:53,055 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:53,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -560553258, now seen corresponding path program 3 times [2024-09-12 18:00:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958128900] [2024-09-12 18:00:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:53,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-09-12 18:00:53,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958128900] [2024-09-12 18:00:53,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958128900] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995180376] [2024-09-12 18:00:53,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 18:00:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:53,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:53,258 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 18:00:53,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 18:00:53,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:00:53,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 18:00:53,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-09-12 18:00:53,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 18:00:53,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995180376] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 18:00:53,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 18:00:53,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-09-12 18:00:53,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993659586] [2024-09-12 18:00:53,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 18:00:53,704 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 18:00:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 18:00:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:00:53,705 INFO L87 Difference]: Start difference. First operand 240 states and 256 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-09-12 18:00:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:53,774 INFO L93 Difference]: Finished difference Result 240 states and 256 transitions. [2024-09-12 18:00:53,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 18:00:53,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 127 [2024-09-12 18:00:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:53,776 INFO L225 Difference]: With dead ends: 240 [2024-09-12 18:00:53,777 INFO L226 Difference]: Without dead ends: 238 [2024-09-12 18:00:53,777 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:00:53,778 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:53,778 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:00:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-09-12 18:00:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-09-12 18:00:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 234 states have (on average 1.0128205128205128) internal successors, (237), 234 states have internal predecessors, (237), 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-09-12 18:00:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2024-09-12 18:00:53,813 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 127 [2024-09-12 18:00:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:53,813 INFO L474 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2024-09-12 18:00:53,813 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-09-12 18:00:53,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2024-09-12 18:00:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-09-12 18:00:53,816 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:53,816 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:53,834 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 18:00:54,017 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:54,017 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:54,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 770556532, now seen corresponding path program 1 times [2024-09-12 18:00:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644991811] [2024-09-12 18:00:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:54,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1623 backedges. 0 proven. 866 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-09-12 18:00:54,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644991811] [2024-09-12 18:00:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644991811] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92265284] [2024-09-12 18:00:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:54,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:54,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:54,224 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:54,225 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 18:00:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:54,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:00:54,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1623 backedges. 0 proven. 866 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-09-12 18:00:54,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:00:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1623 backedges. 0 proven. 866 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-09-12 18:00:54,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92265284] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:00:54,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:00:54,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-09-12 18:00:54,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65497433] [2024-09-12 18:00:54,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:00:54,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 18:00:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:54,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 18:00:54,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-12 18:00:54,851 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-09-12 18:00:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:55,094 INFO L93 Difference]: Finished difference Result 587 states and 594 transitions. [2024-09-12 18:00:55,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 18:00:55,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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 237 [2024-09-12 18:00:55,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:55,098 INFO L225 Difference]: With dead ends: 587 [2024-09-12 18:00:55,098 INFO L226 Difference]: Without dead ends: 586 [2024-09-12 18:00:55,099 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-09-12 18:00:55,100 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:55,100 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 16 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 18:00:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-09-12 18:00:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2024-09-12 18:00:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 582 states have (on average 1.0103092783505154) internal successors, (588), 582 states have internal predecessors, (588), 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-09-12 18:00:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 591 transitions. [2024-09-12 18:00:55,186 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 591 transitions. Word has length 237 [2024-09-12 18:00:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:55,187 INFO L474 AbstractCegarLoop]: Abstraction has 586 states and 591 transitions. [2024-09-12 18:00:55,187 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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-09-12 18:00:55,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 591 transitions. [2024-09-12 18:00:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-09-12 18:00:55,196 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 18:00:55,197 INFO L216 NwaCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:55,217 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 18:00:55,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 18:00:55,398 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2024-09-12 18:00:55,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2097031797, now seen corresponding path program 2 times [2024-09-12 18:00:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 18:00:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393599116] [2024-09-12 18:00:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 18:00:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 18:00:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:55,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 18:00:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 18:00:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10917 backedges. 0 proven. 3611 refuted. 0 times theorem prover too weak. 7306 trivial. 0 not checked. [2024-09-12 18:00:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 18:00:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393599116] [2024-09-12 18:00:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393599116] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 18:00:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910423947] [2024-09-12 18:00:55,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 18:00:55,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 18:00:55,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 18:00:55,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 18:00:55,833 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 18:00:56,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 18:00:56,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 18:00:56,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 18:00:56,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 18:00:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10917 backedges. 0 proven. 3611 refuted. 0 times theorem prover too weak. 7306 trivial. 0 not checked. [2024-09-12 18:00:56,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 18:00:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10917 backedges. 0 proven. 3611 refuted. 0 times theorem prover too weak. 7306 trivial. 0 not checked. [2024-09-12 18:00:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910423947] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 18:00:57,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 18:00:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-09-12 18:00:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485587277] [2024-09-12 18:00:57,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 18:00:57,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 18:00:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 18:00:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 18:00:57,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 18:00:57,265 INFO L87 Difference]: Start difference. First operand 586 states and 591 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-09-12 18:00:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 18:00:57,373 INFO L93 Difference]: Finished difference Result 586 states and 591 transitions. [2024-09-12 18:00:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 18:00:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 585 [2024-09-12 18:00:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 18:00:57,376 INFO L225 Difference]: With dead ends: 586 [2024-09-12 18:00:57,376 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 18:00:57,379 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1176 GetRequests, 1170 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 18:00:57,379 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 18:00:57,380 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 10 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 18:00:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 18:00:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 18:00:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 18:00:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 18:00:57,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 585 [2024-09-12 18:00:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 18:00:57,381 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 18:00:57,382 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-09-12 18:00:57,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 18:00:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 18:00:57,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 18:00:57,385 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 21 remaining) [2024-09-12 18:00:57,385 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2024-09-12 18:00:57,385 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2024-09-12 18:00:57,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2024-09-12 18:00:57,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 21 remaining) [2024-09-12 18:00:57,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2024-09-12 18:00:57,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2024-09-12 18:00:57,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2024-09-12 18:00:57,386 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2024-09-12 18:00:57,387 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (11 of 21 remaining) [2024-09-12 18:00:57,387 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2024-09-12 18:00:57,387 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2024-09-12 18:00:57,387 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2024-09-12 18:00:57,387 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2024-09-12 18:00:57,387 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2024-09-12 18:00:57,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2024-09-12 18:00:57,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (4 of 21 remaining) [2024-09-12 18:00:57,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2024-09-12 18:00:57,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2024-09-12 18:00:57,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2024-09-12 18:00:57,388 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2024-09-12 18:00:57,408 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 18:00:57,592 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-12 18:00:57,596 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 18:00:57,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 18:01:01,585 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 18:01:01,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 06:01:01 BoogieIcfgContainer [2024-09-12 18:01:01,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 18:01:01,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 18:01:01,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 18:01:01,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 18:01:01,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 06:00:47" (3/4) ... [2024-09-12 18:01:01,609 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 18:01:01,612 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 18:01:01,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 18:01:01,617 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-09-12 18:01:01,617 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 18:01:01,618 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 18:01:01,618 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 18:01:01,647 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((main__nlen <= 2147483647) && (main__i == 0)) && (\old(__return_100) == __return_100)) [2024-09-12 18:01:01,647 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 <= main__i) && (main__j <= 7)) && (1 <= main__j)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100)) || (((((main__j == 0) && (1 <= main__nlen)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (\old(__return_100) == __return_100))) || (((((1 <= main__i) && (main__j == 0)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100))) || ((((((main__j <= 7) && (1 <= main__j)) && (1 <= main__nlen)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (\old(__return_100) == __return_100))) [2024-09-12 18:01:01,648 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 <= main__i) && (main__j == 0)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100)) || (((((1 <= main__i) && (1 <= main__j)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100))) || (((((1 <= main__j) && (1 <= main__nlen)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (\old(__return_100) == __return_100))) [2024-09-12 18:01:01,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 18:01:01,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 18:01:01,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 18:01:01,718 INFO L158 Benchmark]: Toolchain (without parser) took 14808.30ms. Allocated memory was 54.5MB in the beginning and 314.6MB in the end (delta: 260.0MB). Free memory was 32.0MB in the beginning and 236.4MB in the end (delta: -204.4MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,719 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 39.8MB. Free memory is still 21.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 18:01:01,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.62ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.8MB in the beginning and 43.9MB in the end (delta: -12.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.23ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 43.0MB in the end (delta: 928.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,719 INFO L158 Benchmark]: Boogie Preprocessor took 58.40ms. Allocated memory is still 67.1MB. Free memory was 43.0MB in the beginning and 41.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,720 INFO L158 Benchmark]: RCFGBuilder took 494.27ms. Allocated memory is still 67.1MB. Free memory was 41.2MB in the beginning and 44.0MB in the end (delta: -2.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,720 INFO L158 Benchmark]: TraceAbstraction took 13799.47ms. Allocated memory was 67.1MB in the beginning and 314.6MB in the end (delta: 247.5MB). Free memory was 43.4MB in the beginning and 241.7MB in the end (delta: -198.3MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,720 INFO L158 Benchmark]: Witness Printer took 111.94ms. Allocated memory is still 314.6MB. Free memory was 241.7MB in the beginning and 236.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-12 18:01:01,721 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.20ms. Allocated memory is still 39.8MB. Free memory is still 21.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.62ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.8MB in the beginning and 43.9MB in the end (delta: -12.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.23ms. Allocated memory is still 67.1MB. Free memory was 43.9MB in the beginning and 43.0MB in the end (delta: 928.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.40ms. Allocated memory is still 67.1MB. Free memory was 43.0MB in the beginning and 41.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 494.27ms. Allocated memory is still 67.1MB. Free memory was 41.2MB in the beginning and 44.0MB in the end (delta: -2.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13799.47ms. Allocated memory was 67.1MB in the beginning and 314.6MB in the end (delta: 247.5MB). Free memory was 43.4MB in the beginning and 241.7MB in the end (delta: -198.3MB). Peak memory consumption was 157.3MB. Max. memory is 16.1GB. * Witness Printer took 111.94ms. Allocated memory is still 314.6MB. Free memory was 241.7MB in the beginning and 236.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: 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: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: 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: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 64]: 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: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 75]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 94]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 14, TraceHistogramMax: 40, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1230 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1230 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 93 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2200 GetRequests, 2100 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=586occurred in iteration=13, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 57 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2376 NumberOfCodeBlocks, 2292 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3316 ConstructedInterpolants, 0 QuantifiedInterpolants, 10733 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1996 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 25046/39102 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 21 specifications checked. All of them hold - InvariantResult [Line: 55]: Location Invariant Derived location invariant: (((((((1 <= main__i) && (main__j == 0)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100)) || (((((1 <= main__i) && (1 <= main__j)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100))) || (((((1 <= main__j) && (1 <= main__nlen)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (\old(__return_100) == __return_100))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((((((1 <= main__i) && (main__j <= 7)) && (1 <= main__j)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100)) || (((((main__j == 0) && (1 <= main__nlen)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (\old(__return_100) == __return_100))) || (((((1 <= main__i) && (main__j == 0)) && (main__nlen <= 2147483647)) && (((long long) main__i + 1) <= main__nlen)) && (\old(__return_100) == __return_100))) || ((((((main__j <= 7) && (1 <= main__j)) && (1 <= main__nlen)) && (main__nlen <= 2147483647)) && (main__i == 0)) && (\old(__return_100) == __return_100))) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: (((main__nlen <= 2147483647) && (main__i == 0)) && (\old(__return_100) == __return_100)) RESULT: Ultimate proved your program to be correct! [2024-09-12 18:01:01,755 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