./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-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/apache-escape-absolute.i.v+cfa-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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --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 17:56:23,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:56:23,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:56:23,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:56:23,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:56:23,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:56:23,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:56:23,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:56:23,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:56:23,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:56:23,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:56:23,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:56:23,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:56:23,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:56:23,409 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:56:23,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:56:23,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:56:23,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:56:23,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:56:23,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:56:23,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:56:23,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:56:23,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:56:23,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:56:23,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:56:23,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:56:23,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:56:23,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:56:23,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:56:23,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:56:23,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:56:23,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:56:23,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:56:23,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:56:23,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:56:23,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:56:23,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:56:23,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:56:23,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:56:23,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:56:23,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:56:23,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:56:23,419 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c 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 17:56:23,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:56:23,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:56:23,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:56:23,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:56:23,699 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:56:23,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2024-09-12 17:56:25,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:56:25,217 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:56:25,218 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2024-09-12 17:56:25,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f8416f3fa/9cd1235e6d12451498dfe01596538dea/FLAG73c00b7e9 [2024-09-12 17:56:25,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f8416f3fa/9cd1235e6d12451498dfe01596538dea [2024-09-12 17:56:25,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:56:25,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:56:25,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:56:25,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:56:25,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:56:25,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f934b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25, skipping insertion in model container [2024-09-12 17:56:25,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:56:25,429 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/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2024-09-12 17:56:25,436 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/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2024-09-12 17:56:25,438 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/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2024-09-12 17:56:25,439 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/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2024-09-12 17:56:25,441 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/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2024-09-12 17:56:25,443 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/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2024-09-12 17:56:25,445 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/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2024-09-12 17:56:25,447 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/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2024-09-12 17:56:25,452 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/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2024-09-12 17:56:25,454 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/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2024-09-12 17:56:25,457 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/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2024-09-12 17:56:25,460 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/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2024-09-12 17:56:25,462 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/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2024-09-12 17:56:25,465 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/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2024-09-12 17:56:25,468 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/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2024-09-12 17:56:25,470 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/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2024-09-12 17:56:25,477 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/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2024-09-12 17:56:25,479 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/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2024-09-12 17:56:25,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:56:25,493 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:56:25,505 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/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2024-09-12 17:56:25,506 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/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2024-09-12 17:56:25,510 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/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2024-09-12 17:56:25,512 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/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2024-09-12 17:56:25,514 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/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2024-09-12 17:56:25,516 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/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2024-09-12 17:56:25,518 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/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2024-09-12 17:56:25,520 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/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2024-09-12 17:56:25,526 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/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2024-09-12 17:56:25,527 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/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2024-09-12 17:56:25,528 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/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2024-09-12 17:56:25,529 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/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2024-09-12 17:56:25,530 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/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2024-09-12 17:56:25,532 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/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2024-09-12 17:56:25,533 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/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2024-09-12 17:56:25,534 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/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2024-09-12 17:56:25,535 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/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2024-09-12 17:56:25,550 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/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2024-09-12 17:56:25,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:56:25,574 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:56:25,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25 WrapperNode [2024-09-12 17:56:25,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:56:25,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:56:25,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:56:25,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:56:25,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,613 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:56:25,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:56:25,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:56:25,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:56:25,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:56:25,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,640 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 17:56:25,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,645 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:56:25,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:56:25,651 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:56:25,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:56:25,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (1/1) ... [2024-09-12 17:56:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:56:25,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:25,686 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 17:56:25,691 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 17:56:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:56:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:56:25,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:56:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:56:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:56:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:56:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:56:25,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:56:25,786 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:56:25,788 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:56:26,101 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-09-12 17:56:26,101 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:56:26,138 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:56:26,138 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 17:56:26,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:56:26 BoogieIcfgContainer [2024-09-12 17:56:26,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:56:26,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:56:26,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:56:26,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:56:26,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:56:25" (1/3) ... [2024-09-12 17:56:26,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39faef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:56:26, skipping insertion in model container [2024-09-12 17:56:26,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:25" (2/3) ... [2024-09-12 17:56:26,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39faef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:56:26, skipping insertion in model container [2024-09-12 17:56:26,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:56:26" (3/3) ... [2024-09-12 17:56:26,146 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2024-09-12 17:56:26,159 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:56:26,160 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-09-12 17:56:26,212 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:56:26,217 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;@319513b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:56:26,217 INFO L337 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2024-09-12 17:56:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 92 states have (on average 1.934782608695652) internal successors, (178), 140 states have internal predecessors, (178), 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 17:56:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 17:56:26,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:26,226 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:26,226 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:26,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1815066151, now seen corresponding path program 1 times [2024-09-12 17:56:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:26,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210614075] [2024-09-12 17:56:26,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:26,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:26,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:26,394 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 17:56:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210614075] [2024-09-12 17:56:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210614075] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:26,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127548577] [2024-09-12 17:56:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:26,400 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:26,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:26,426 INFO L87 Difference]: Start difference. First operand has 145 states, 92 states have (on average 1.934782608695652) internal successors, (178), 140 states have internal predecessors, (178), 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 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:26,706 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2024-09-12 17:56:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:26,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 17:56:26,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:26,714 INFO L225 Difference]: With dead ends: 156 [2024-09-12 17:56:26,714 INFO L226 Difference]: Without dead ends: 135 [2024-09-12 17:56:26,716 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 17:56:26,718 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 283 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:26,718 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 12 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-12 17:56:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-09-12 17:56:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 131 states have internal predecessors, (135), 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 17:56:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2024-09-12 17:56:26,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 16 [2024-09-12 17:56:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:26,778 INFO L474 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2024-09-12 17:56:26,778 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:26,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2024-09-12 17:56:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 17:56:26,779 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:26,779 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:26,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:56:26,780 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:26,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -432475757, now seen corresponding path program 1 times [2024-09-12 17:56:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240317198] [2024-09-12 17:56:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:26,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:26,844 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 17:56:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240317198] [2024-09-12 17:56:26,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240317198] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:26,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:26,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:26,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160174813] [2024-09-12 17:56:26,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:26,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:26,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:26,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:26,847 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:27,022 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2024-09-12 17:56:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:27,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 17:56:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:27,024 INFO L225 Difference]: With dead ends: 135 [2024-09-12 17:56:27,025 INFO L226 Difference]: Without dead ends: 130 [2024-09-12 17:56:27,025 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 17:56:27,026 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 246 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:27,026 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 7 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-12 17:56:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-09-12 17:56:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 126 states have internal predecessors, (130), 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 17:56:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2024-09-12 17:56:27,049 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 17 [2024-09-12 17:56:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:27,050 INFO L474 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2024-09-12 17:56:27,050 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:27,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2024-09-12 17:56:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:56:27,051 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:27,051 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 17:56:27,051 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:56:27,051 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:27,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1002627797, now seen corresponding path program 1 times [2024-09-12 17:56:27,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:27,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195753693] [2024-09-12 17:56:27,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:27,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:27,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:27,098 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 17:56:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:27,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195753693] [2024-09-12 17:56:27,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195753693] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:27,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:27,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:56:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959991692] [2024-09-12 17:56:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:27,099 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:27,100 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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 17:56:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:27,298 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2024-09-12 17:56:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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 17:56:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:27,299 INFO L225 Difference]: With dead ends: 130 [2024-09-12 17:56:27,300 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 17:56:27,301 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:27,302 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 217 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:27,303 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 10 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 17:56:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-09-12 17:56:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 118 states have internal predecessors, (122), 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 17:56:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2024-09-12 17:56:27,337 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 19 [2024-09-12 17:56:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:27,337 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2024-09-12 17:56:27,337 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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 17:56:27,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2024-09-12 17:56:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:56:27,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:27,338 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] [2024-09-12 17:56:27,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:56:27,338 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:27,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1016690719, now seen corresponding path program 1 times [2024-09-12 17:56:27,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:27,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143059835] [2024-09-12 17:56:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:27,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:27,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:27,414 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 17:56:27,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143059835] [2024-09-12 17:56:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143059835] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:56:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403913357] [2024-09-12 17:56:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:27,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:27,418 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17:56:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:27,679 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2024-09-12 17:56:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:27,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 20 [2024-09-12 17:56:27,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:27,681 INFO L225 Difference]: With dead ends: 166 [2024-09-12 17:56:27,681 INFO L226 Difference]: Without dead ends: 159 [2024-09-12 17:56:27,681 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:27,682 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:27,682 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 10 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-09-12 17:56:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2024-09-12 17:56:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 143 states have internal predecessors, (155), 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 17:56:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2024-09-12 17:56:27,708 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 20 [2024-09-12 17:56:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:27,708 INFO L474 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-09-12 17:56:27,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17:56:27,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2024-09-12 17:56:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 17:56:27,709 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:27,709 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] [2024-09-12 17:56:27,709 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:56:27,709 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:27,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2082207553, now seen corresponding path program 1 times [2024-09-12 17:56:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:27,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696212206] [2024-09-12 17:56:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:27,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:27,799 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 17:56:27,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:27,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696212206] [2024-09-12 17:56:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696212206] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922068171] [2024-09-12 17:56:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:27,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:27,801 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 17:56:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:28,021 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2024-09-12 17:56:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:28,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 22 [2024-09-12 17:56:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:28,023 INFO L225 Difference]: With dead ends: 178 [2024-09-12 17:56:28,023 INFO L226 Difference]: Without dead ends: 176 [2024-09-12 17:56:28,023 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 17:56:28,024 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:28,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 10 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-09-12 17:56:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2024-09-12 17:56:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 141 states have internal predecessors, (153), 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 17:56:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 156 transitions. [2024-09-12 17:56:28,052 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 156 transitions. Word has length 22 [2024-09-12 17:56:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:28,052 INFO L474 AbstractCegarLoop]: Abstraction has 145 states and 156 transitions. [2024-09-12 17:56:28,052 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 17:56:28,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 156 transitions. [2024-09-12 17:56:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 17:56:28,053 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:28,053 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] [2024-09-12 17:56:28,053 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:56:28,053 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:28,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1164491329, now seen corresponding path program 1 times [2024-09-12 17:56:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:28,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965764800] [2024-09-12 17:56:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:28,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:28,183 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 17:56:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965764800] [2024-09-12 17:56:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965764800] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:56:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532908357] [2024-09-12 17:56:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:28,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:28,193 INFO L87 Difference]: Start difference. First operand 145 states and 156 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 17:56:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:28,480 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2024-09-12 17:56:28,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 25 [2024-09-12 17:56:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:28,482 INFO L225 Difference]: With dead ends: 145 [2024-09-12 17:56:28,482 INFO L226 Difference]: Without dead ends: 143 [2024-09-12 17:56:28,482 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:56:28,483 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:28,483 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 16 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-09-12 17:56:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-09-12 17:56:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 139 states have internal predecessors, (151), 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 17:56:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2024-09-12 17:56:28,503 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 25 [2024-09-12 17:56:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:28,503 INFO L474 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2024-09-12 17:56:28,503 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 17:56:28,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2024-09-12 17:56:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 17:56:28,504 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:28,504 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 17:56:28,504 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:56:28,505 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:28,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1910393698, now seen corresponding path program 1 times [2024-09-12 17:56:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:28,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959428375] [2024-09-12 17:56:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:28,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:28,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:28,593 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 17:56:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:28,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959428375] [2024-09-12 17:56:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959428375] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:28,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:28,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:28,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042619719] [2024-09-12 17:56:28,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:28,596 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:28,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:28,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:28,598 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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 17:56:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:28,800 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2024-09-12 17:56:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:28,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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 17:56:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:28,801 INFO L225 Difference]: With dead ends: 174 [2024-09-12 17:56:28,801 INFO L226 Difference]: Without dead ends: 172 [2024-09-12 17:56:28,802 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 17:56:28,802 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 202 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:28,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 10 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-09-12 17:56:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2024-09-12 17:56:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 137 states have internal predecessors, (149), 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 17:56:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2024-09-12 17:56:28,815 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 27 [2024-09-12 17:56:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:28,815 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2024-09-12 17:56:28,815 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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 17:56:28,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2024-09-12 17:56:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 17:56:28,816 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:28,816 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] [2024-09-12 17:56:28,816 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 17:56:28,817 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:28,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash -907334385, now seen corresponding path program 1 times [2024-09-12 17:56:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795975042] [2024-09-12 17:56:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:28,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:28,871 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 17:56:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795975042] [2024-09-12 17:56:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795975042] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392918930] [2024-09-12 17:56:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:28,872 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:28,873 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 17:56:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:29,062 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2024-09-12 17:56:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2024-09-12 17:56:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:29,063 INFO L225 Difference]: With dead ends: 141 [2024-09-12 17:56:29,063 INFO L226 Difference]: Without dead ends: 139 [2024-09-12 17:56:29,064 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:29,064 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 192 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:29,064 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 13 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-09-12 17:56:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-09-12 17:56:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.3125) internal successors, (147), 135 states have internal predecessors, (147), 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 17:56:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 150 transitions. [2024-09-12 17:56:29,076 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 150 transitions. Word has length 28 [2024-09-12 17:56:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:29,076 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 150 transitions. [2024-09-12 17:56:29,076 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 17:56:29,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 150 transitions. [2024-09-12 17:56:29,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 17:56:29,077 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:29,077 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, 1, 1, 1, 1] [2024-09-12 17:56:29,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 17:56:29,077 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:29,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1095419747, now seen corresponding path program 1 times [2024-09-12 17:56:29,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747749914] [2024-09-12 17:56:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:29,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:29,131 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 17:56:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747749914] [2024-09-12 17:56:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747749914] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028438304] [2024-09-12 17:56:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:29,132 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:29,132 INFO L87 Difference]: Start difference. First operand 139 states and 150 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 17:56:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:29,389 INFO L93 Difference]: Finished difference Result 170 states and 183 transitions. [2024-09-12 17:56:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 33 [2024-09-12 17:56:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:29,390 INFO L225 Difference]: With dead ends: 170 [2024-09-12 17:56:29,390 INFO L226 Difference]: Without dead ends: 168 [2024-09-12 17:56:29,390 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:29,391 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 195 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:29,391 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 13 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-09-12 17:56:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2024-09-12 17:56:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 137 states have internal predecessors, (148), 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 17:56:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2024-09-12 17:56:29,405 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 33 [2024-09-12 17:56:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:29,406 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2024-09-12 17:56:29,406 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 17:56:29,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2024-09-12 17:56:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 17:56:29,407 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:29,407 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, 1, 1, 1, 1] [2024-09-12 17:56:29,407 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 17:56:29,407 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr44ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:29,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1090443652, now seen corresponding path program 1 times [2024-09-12 17:56:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:29,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499534533] [2024-09-12 17:56:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:29,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:29,457 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 17:56:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499534533] [2024-09-12 17:56:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499534533] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830774603] [2024-09-12 17:56:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:29,458 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:29,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:29,459 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 17:56:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:29,735 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2024-09-12 17:56:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:29,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 33 [2024-09-12 17:56:29,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:29,737 INFO L225 Difference]: With dead ends: 168 [2024-09-12 17:56:29,737 INFO L226 Difference]: Without dead ends: 166 [2024-09-12 17:56:29,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:29,737 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 191 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:29,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 13 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-09-12 17:56:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2024-09-12 17:56:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 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 17:56:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2024-09-12 17:56:29,751 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 33 [2024-09-12 17:56:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:29,751 INFO L474 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2024-09-12 17:56:29,752 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 17:56:29,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2024-09-12 17:56:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 17:56:29,752 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:29,753 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, 1, 1, 1, 1, 1] [2024-09-12 17:56:29,753 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 17:56:29,753 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:29,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -401723065, now seen corresponding path program 1 times [2024-09-12 17:56:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437150013] [2024-09-12 17:56:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:29,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:29,833 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 17:56:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:29,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437150013] [2024-09-12 17:56:29,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437150013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:29,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:29,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860310669] [2024-09-12 17:56:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:29,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:29,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:29,835 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 17:56:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:30,040 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2024-09-12 17:56:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2024-09-12 17:56:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:30,041 INFO L225 Difference]: With dead ends: 141 [2024-09-12 17:56:30,041 INFO L226 Difference]: Without dead ends: 139 [2024-09-12 17:56:30,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:30,042 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 182 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:30,042 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 13 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-09-12 17:56:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-09-12 17:56:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 135 states have internal predecessors, (144), 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 17:56:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2024-09-12 17:56:30,055 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 34 [2024-09-12 17:56:30,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:30,055 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2024-09-12 17:56:30,055 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 17:56:30,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2024-09-12 17:56:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 17:56:30,056 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:30,056 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, 1, 1, 1, 1, 1] [2024-09-12 17:56:30,056 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 17:56:30,057 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr45ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:30,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash -555981861, now seen corresponding path program 1 times [2024-09-12 17:56:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976908946] [2024-09-12 17:56:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,103 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 17:56:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976908946] [2024-09-12 17:56:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976908946] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:30,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:30,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314333542] [2024-09-12 17:56:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:30,104 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:30,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:30,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:30,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:30,105 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 17:56:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:30,302 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2024-09-12 17:56:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2024-09-12 17:56:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:30,303 INFO L225 Difference]: With dead ends: 139 [2024-09-12 17:56:30,303 INFO L226 Difference]: Without dead ends: 137 [2024-09-12 17:56:30,303 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:30,304 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 178 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:30,304 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 13 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-12 17:56:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-09-12 17:56:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.2589285714285714) internal successors, (141), 133 states have internal predecessors, (141), 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 17:56:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2024-09-12 17:56:30,320 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 34 [2024-09-12 17:56:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:30,321 INFO L474 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2024-09-12 17:56:30,321 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 17:56:30,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,321 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2024-09-12 17:56:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 17:56:30,322 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:30,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:30,322 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 17:56:30,322 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr18ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:30,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1218894447, now seen corresponding path program 1 times [2024-09-12 17:56:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601333967] [2024-09-12 17:56:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,344 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 17:56:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601333967] [2024-09-12 17:56:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601333967] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:30,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:56:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410740952] [2024-09-12 17:56:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:30,345 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:30,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:30,346 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 17:56:30,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:30,486 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2024-09-12 17:56:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 40 [2024-09-12 17:56:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:30,487 INFO L225 Difference]: With dead ends: 222 [2024-09-12 17:56:30,487 INFO L226 Difference]: Without dead ends: 135 [2024-09-12 17:56:30,488 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 17:56:30,488 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:30,488 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 7 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-12 17:56:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-09-12 17:56:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.2454545454545454) internal successors, (137), 131 states have internal predecessors, (137), 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 17:56:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2024-09-12 17:56:30,499 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 40 [2024-09-12 17:56:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:30,500 INFO L474 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2024-09-12 17:56:30,500 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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 17:56:30,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2024-09-12 17:56:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 17:56:30,501 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:30,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:30,501 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 17:56:30,501 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr18ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:30,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1735050205, now seen corresponding path program 1 times [2024-09-12 17:56:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506690018] [2024-09-12 17:56:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,574 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 17:56:30,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506690018] [2024-09-12 17:56:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506690018] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:30,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244972461] [2024-09-12 17:56:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:30,575 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:30,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:30,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:30,576 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 17:56:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:30,756 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2024-09-12 17:56:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:30,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 41 [2024-09-12 17:56:30,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:30,758 INFO L225 Difference]: With dead ends: 135 [2024-09-12 17:56:30,758 INFO L226 Difference]: Without dead ends: 133 [2024-09-12 17:56:30,758 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:30,758 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 164 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:30,759 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 13 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:30,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-09-12 17:56:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-09-12 17:56:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 129 states have internal predecessors, (134), 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 17:56:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2024-09-12 17:56:30,771 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 41 [2024-09-12 17:56:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:30,771 INFO L474 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2024-09-12 17:56:30,772 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 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 17:56:30,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2024-09-12 17:56:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 17:56:30,772 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:30,773 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:30,773 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 17:56:30,773 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr44ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:30,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 868564744, now seen corresponding path program 1 times [2024-09-12 17:56:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275210606] [2024-09-12 17:56:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:56:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275210606] [2024-09-12 17:56:30,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275210606] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:30,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832002269] [2024-09-12 17:56:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:30,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:30,842 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 17:56:30,843 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 17:56:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:30,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 17:56:30,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:56:30,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:56:31,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832002269] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:31,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:31,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-09-12 17:56:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038824007] [2024-09-12 17:56:31,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:31,074 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:31,075 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 17:56:31,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:31,310 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2024-09-12 17:56:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:31,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 41 [2024-09-12 17:56:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:31,312 INFO L225 Difference]: With dead ends: 133 [2024-09-12 17:56:31,312 INFO L226 Difference]: Without dead ends: 131 [2024-09-12 17:56:31,313 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:56:31,313 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 218 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:31,314 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 10 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:31,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-12 17:56:31,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-09-12 17:56:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 127 states have internal predecessors, (132), 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 17:56:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2024-09-12 17:56:31,335 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 41 [2024-09-12 17:56:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:31,335 INFO L474 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2024-09-12 17:56:31,335 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 17:56:31,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2024-09-12 17:56:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 17:56:31,336 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:31,336 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:31,361 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 17:56:31,536 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-12 17:56:31,537 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:31,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:31,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1151054227, now seen corresponding path program 1 times [2024-09-12 17:56:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94796904] [2024-09-12 17:56:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:31,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:56:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94796904] [2024-09-12 17:56:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94796904] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406985510] [2024-09-12 17:56:31,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:31,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:31,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:31,629 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 17:56:31,630 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 17:56:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:31,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 17:56:31,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:56:31,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:56:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406985510] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:31,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:31,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-09-12 17:56:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605476867] [2024-09-12 17:56:31,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:31,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:31,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:31,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:31,751 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 17:56:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:31,950 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2024-09-12 17:56:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:31,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 42 [2024-09-12 17:56:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:31,951 INFO L225 Difference]: With dead ends: 131 [2024-09-12 17:56:31,951 INFO L226 Difference]: Without dead ends: 129 [2024-09-12 17:56:31,952 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:56:31,952 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 211 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:31,952 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 13 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-12 17:56:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-09-12 17:56:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 125 states have internal predecessors, (130), 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 17:56:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2024-09-12 17:56:31,964 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 42 [2024-09-12 17:56:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:31,964 INFO L474 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2024-09-12 17:56:31,964 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 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 17:56:31,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2024-09-12 17:56:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 17:56:31,965 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:31,965 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:31,980 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 17:56:32,165 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 17:56:32,168 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:32,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1467168974, now seen corresponding path program 1 times [2024-09-12 17:56:32,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:32,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920699936] [2024-09-12 17:56:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:32,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920699936] [2024-09-12 17:56:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920699936] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078753304] [2024-09-12 17:56:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:32,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:32,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:32,210 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 17:56:32,211 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 17:56:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:32,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 17:56:32,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:32,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:32,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078753304] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:32,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:32,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-09-12 17:56:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852375602] [2024-09-12 17:56:32,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:32,342 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 17:56:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:32,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 17:56:32,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:56:32,343 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand has 11 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 17:56:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:32,852 INFO L93 Difference]: Finished difference Result 397 states and 426 transitions. [2024-09-12 17:56:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 17:56:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 17:56:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:32,854 INFO L225 Difference]: With dead ends: 397 [2024-09-12 17:56:32,854 INFO L226 Difference]: Without dead ends: 391 [2024-09-12 17:56:32,854 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-09-12 17:56:32,855 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1212 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:32,855 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 16 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 17:56:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-09-12 17:56:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 303. [2024-09-12 17:56:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 284 states have (on average 1.278169014084507) internal successors, (363), 299 states have internal predecessors, (363), 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 17:56:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 366 transitions. [2024-09-12 17:56:32,888 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 366 transitions. Word has length 43 [2024-09-12 17:56:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:32,888 INFO L474 AbstractCegarLoop]: Abstraction has 303 states and 366 transitions. [2024-09-12 17:56:32,888 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 17:56:32,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:32,888 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 366 transitions. [2024-09-12 17:56:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 17:56:32,889 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:32,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:32,901 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 17:56:33,089 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-12 17:56:33,089 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr21ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:33,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1047727319, now seen corresponding path program 1 times [2024-09-12 17:56:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127040722] [2024-09-12 17:56:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:33,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:33,153 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 17:56:33,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:33,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127040722] [2024-09-12 17:56:33,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127040722] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:33,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:33,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:33,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902564531] [2024-09-12 17:56:33,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:33,154 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:33,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:33,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:33,155 INFO L87 Difference]: Start difference. First operand 303 states and 366 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 17:56:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:33,339 INFO L93 Difference]: Finished difference Result 303 states and 366 transitions. [2024-09-12 17:56:33,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:33,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 44 [2024-09-12 17:56:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:33,341 INFO L225 Difference]: With dead ends: 303 [2024-09-12 17:56:33,341 INFO L226 Difference]: Without dead ends: 301 [2024-09-12 17:56:33,342 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:33,342 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 147 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:33,342 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 13 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-09-12 17:56:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-09-12 17:56:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 283 states have (on average 1.2614840989399294) internal successors, (357), 297 states have internal predecessors, (357), 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 17:56:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 360 transitions. [2024-09-12 17:56:33,382 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 360 transitions. Word has length 44 [2024-09-12 17:56:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:33,382 INFO L474 AbstractCegarLoop]: Abstraction has 301 states and 360 transitions. [2024-09-12 17:56:33,383 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 17:56:33,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 360 transitions. [2024-09-12 17:56:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 17:56:33,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:33,383 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, 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 17:56:33,384 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 17:56:33,384 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr28ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:33,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash -371773842, now seen corresponding path program 1 times [2024-09-12 17:56:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18838206] [2024-09-12 17:56:33,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:33,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:33,471 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 17:56:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18838206] [2024-09-12 17:56:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18838206] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:33,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:33,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817234432] [2024-09-12 17:56:33,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:33,472 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:33,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:33,473 INFO L87 Difference]: Start difference. First operand 301 states and 360 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 17:56:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:33,647 INFO L93 Difference]: Finished difference Result 301 states and 360 transitions. [2024-09-12 17:56:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:33,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 53 [2024-09-12 17:56:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:33,649 INFO L225 Difference]: With dead ends: 301 [2024-09-12 17:56:33,649 INFO L226 Difference]: Without dead ends: 299 [2024-09-12 17:56:33,649 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:33,650 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 169 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:33,650 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 10 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-09-12 17:56:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-09-12 17:56:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 282 states have (on average 1.2446808510638299) internal successors, (351), 295 states have internal predecessors, (351), 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 17:56:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 354 transitions. [2024-09-12 17:56:33,684 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 354 transitions. Word has length 53 [2024-09-12 17:56:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:33,684 INFO L474 AbstractCegarLoop]: Abstraction has 299 states and 354 transitions. [2024-09-12 17:56:33,684 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 17:56:33,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 354 transitions. [2024-09-12 17:56:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 17:56:33,685 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:33,685 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, 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 17:56:33,685 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-12 17:56:33,685 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr29ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:33,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:33,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1359915994, now seen corresponding path program 1 times [2024-09-12 17:56:33,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:33,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116050882] [2024-09-12 17:56:33,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:33,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:33,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:33,746 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 17:56:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116050882] [2024-09-12 17:56:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116050882] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:56:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485214365] [2024-09-12 17:56:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:33,747 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:33,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:33,747 INFO L87 Difference]: Start difference. First operand 299 states and 354 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 17:56:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:33,989 INFO L93 Difference]: Finished difference Result 299 states and 354 transitions. [2024-09-12 17:56:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 54 [2024-09-12 17:56:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:33,991 INFO L225 Difference]: With dead ends: 299 [2024-09-12 17:56:33,991 INFO L226 Difference]: Without dead ends: 297 [2024-09-12 17:56:33,991 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:56:33,991 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 191 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:33,992 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 13 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-09-12 17:56:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-09-12 17:56:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 281 states have (on average 1.2277580071174377) internal successors, (345), 293 states have internal predecessors, (345), 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 17:56:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 348 transitions. [2024-09-12 17:56:34,027 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 348 transitions. Word has length 54 [2024-09-12 17:56:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:34,027 INFO L474 AbstractCegarLoop]: Abstraction has 297 states and 348 transitions. [2024-09-12 17:56:34,028 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 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 17:56:34,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 348 transitions. [2024-09-12 17:56:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-12 17:56:34,028 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:34,028 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, 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 17:56:34,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-12 17:56:34,028 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:34,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1166030538, now seen corresponding path program 1 times [2024-09-12 17:56:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506519555] [2024-09-12 17:56:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,053 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 17:56:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:34,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506519555] [2024-09-12 17:56:34,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506519555] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:34,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:34,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:34,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592192271] [2024-09-12 17:56:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:34,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:34,055 INFO L87 Difference]: Start difference. First operand 297 states and 348 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 17:56:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:34,171 INFO L93 Difference]: Finished difference Result 297 states and 348 transitions. [2024-09-12 17:56:34,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:34,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 57 [2024-09-12 17:56:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:34,173 INFO L225 Difference]: With dead ends: 297 [2024-09-12 17:56:34,173 INFO L226 Difference]: Without dead ends: 296 [2024-09-12 17:56:34,173 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 17:56:34,174 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:34,174 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 7 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-09-12 17:56:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2024-09-12 17:56:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.209964412811388) internal successors, (340), 292 states have internal predecessors, (340), 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 17:56:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 343 transitions. [2024-09-12 17:56:34,206 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 343 transitions. Word has length 57 [2024-09-12 17:56:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:34,206 INFO L474 AbstractCegarLoop]: Abstraction has 296 states and 343 transitions. [2024-09-12 17:56:34,206 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 17:56:34,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 343 transitions. [2024-09-12 17:56:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-12 17:56:34,207 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:34,207 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, 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 17:56:34,207 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-12 17:56:34,207 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:34,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1787208096, now seen corresponding path program 1 times [2024-09-12 17:56:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:34,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233898440] [2024-09-12 17:56:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:34,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,234 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 17:56:34,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233898440] [2024-09-12 17:56:34,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233898440] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:34,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:34,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356973715] [2024-09-12 17:56:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:34,235 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:34,235 INFO L87 Difference]: Start difference. First operand 296 states and 343 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 17:56:34,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:34,357 INFO L93 Difference]: Finished difference Result 296 states and 343 transitions. [2024-09-12 17:56:34,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:34,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 58 [2024-09-12 17:56:34,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:34,360 INFO L225 Difference]: With dead ends: 296 [2024-09-12 17:56:34,360 INFO L226 Difference]: Without dead ends: 295 [2024-09-12 17:56:34,360 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 17:56:34,360 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:34,360 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 7 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:34,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-09-12 17:56:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-09-12 17:56:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 281 states have (on average 1.1921708185053381) internal successors, (335), 291 states have internal predecessors, (335), 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 17:56:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 338 transitions. [2024-09-12 17:56:34,394 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 338 transitions. Word has length 58 [2024-09-12 17:56:34,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:34,394 INFO L474 AbstractCegarLoop]: Abstraction has 295 states and 338 transitions. [2024-09-12 17:56:34,394 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 17:56:34,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,394 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 338 transitions. [2024-09-12 17:56:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-12 17:56:34,395 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:34,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:34,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-12 17:56:34,395 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr34ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:34,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1993396155, now seen corresponding path program 1 times [2024-09-12 17:56:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:34,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263047750] [2024-09-12 17:56:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,448 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 17:56:34,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263047750] [2024-09-12 17:56:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263047750] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278917651] [2024-09-12 17:56:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:34,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:34,449 INFO L87 Difference]: Start difference. First operand 295 states and 338 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 17:56:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:34,737 INFO L93 Difference]: Finished difference Result 377 states and 449 transitions. [2024-09-12 17:56:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 61 [2024-09-12 17:56:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:34,739 INFO L225 Difference]: With dead ends: 377 [2024-09-12 17:56:34,739 INFO L226 Difference]: Without dead ends: 375 [2024-09-12 17:56:34,739 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:34,739 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 207 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:34,739 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 13 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:34,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-09-12 17:56:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 323. [2024-09-12 17:56:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 309 states have (on average 1.1715210355987056) internal successors, (362), 319 states have internal predecessors, (362), 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 17:56:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 365 transitions. [2024-09-12 17:56:34,776 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 365 transitions. Word has length 61 [2024-09-12 17:56:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:34,777 INFO L474 AbstractCegarLoop]: Abstraction has 323 states and 365 transitions. [2024-09-12 17:56:34,777 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 17:56:34,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 365 transitions. [2024-09-12 17:56:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-12 17:56:34,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:34,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:34,777 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-12 17:56:34,778 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr35ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:34,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1665741896, now seen corresponding path program 1 times [2024-09-12 17:56:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:34,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273673498] [2024-09-12 17:56:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:34,847 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 17:56:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:34,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273673498] [2024-09-12 17:56:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273673498] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:34,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159619480] [2024-09-12 17:56:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:34,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:34,848 INFO L87 Difference]: Start difference. First operand 323 states and 365 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 17:56:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:35,068 INFO L93 Difference]: Finished difference Result 323 states and 365 transitions. [2024-09-12 17:56:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 62 [2024-09-12 17:56:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:35,069 INFO L225 Difference]: With dead ends: 323 [2024-09-12 17:56:35,070 INFO L226 Difference]: Without dead ends: 321 [2024-09-12 17:56:35,070 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:35,070 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 110 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:35,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 13 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-09-12 17:56:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-09-12 17:56:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 308 states have (on average 1.155844155844156) internal successors, (356), 317 states have internal predecessors, (356), 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 17:56:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 359 transitions. [2024-09-12 17:56:35,106 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 359 transitions. Word has length 62 [2024-09-12 17:56:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:35,106 INFO L474 AbstractCegarLoop]: Abstraction has 321 states and 359 transitions. [2024-09-12 17:56:35,106 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 17:56:35,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,106 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 359 transitions. [2024-09-12 17:56:35,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 17:56:35,107 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:35,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:35,107 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-09-12 17:56:35,107 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:35,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash 98394465, now seen corresponding path program 1 times [2024-09-12 17:56:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014717775] [2024-09-12 17:56:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:35,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:35,135 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 17:56:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:35,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014717775] [2024-09-12 17:56:35,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014717775] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:35,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:35,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77587500] [2024-09-12 17:56:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:35,136 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:35,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:35,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:35,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:35,136 INFO L87 Difference]: Start difference. First operand 321 states and 359 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 17:56:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:35,293 INFO L93 Difference]: Finished difference Result 380 states and 431 transitions. [2024-09-12 17:56:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:35,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 63 [2024-09-12 17:56:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:35,295 INFO L225 Difference]: With dead ends: 380 [2024-09-12 17:56:35,295 INFO L226 Difference]: Without dead ends: 378 [2024-09-12 17:56:35,295 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 17:56:35,296 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:35,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 7 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-09-12 17:56:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 375. [2024-09-12 17:56:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 362 states have (on average 1.1519337016574585) internal successors, (417), 371 states have internal predecessors, (417), 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 17:56:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 420 transitions. [2024-09-12 17:56:35,337 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 420 transitions. Word has length 63 [2024-09-12 17:56:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:35,337 INFO L474 AbstractCegarLoop]: Abstraction has 375 states and 420 transitions. [2024-09-12 17:56:35,338 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 17:56:35,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 420 transitions. [2024-09-12 17:56:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-12 17:56:35,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:35,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:35,342 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-09-12 17:56:35,342 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr38ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:35,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2102045389, now seen corresponding path program 1 times [2024-09-12 17:56:35,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:35,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017509960] [2024-09-12 17:56:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:35,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:35,391 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 17:56:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017509960] [2024-09-12 17:56:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017509960] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:35,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:35,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:35,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747727163] [2024-09-12 17:56:35,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:35,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:35,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:35,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:35,393 INFO L87 Difference]: Start difference. First operand 375 states and 420 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 17:56:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:35,581 INFO L93 Difference]: Finished difference Result 402 states and 447 transitions. [2024-09-12 17:56:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:35,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 66 [2024-09-12 17:56:35,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:35,583 INFO L225 Difference]: With dead ends: 402 [2024-09-12 17:56:35,583 INFO L226 Difference]: Without dead ends: 400 [2024-09-12 17:56:35,583 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:35,583 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:35,584 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 10 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-09-12 17:56:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 373. [2024-09-12 17:56:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 361 states have (on average 1.1385041551246537) internal successors, (411), 369 states have internal predecessors, (411), 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 17:56:35,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 414 transitions. [2024-09-12 17:56:35,626 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 414 transitions. Word has length 66 [2024-09-12 17:56:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:35,627 INFO L474 AbstractCegarLoop]: Abstraction has 373 states and 414 transitions. [2024-09-12 17:56:35,627 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 17:56:35,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,627 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 414 transitions. [2024-09-12 17:56:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-12 17:56:35,627 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:35,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:35,628 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-12 17:56:35,628 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr39ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:35,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 738900873, now seen corresponding path program 1 times [2024-09-12 17:56:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:35,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223272776] [2024-09-12 17:56:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:35,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:35,691 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 17:56:35,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:35,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223272776] [2024-09-12 17:56:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223272776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:35,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:35,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418421995] [2024-09-12 17:56:35,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:35,692 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:35,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:35,692 INFO L87 Difference]: Start difference. First operand 373 states and 414 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 17:56:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:35,910 INFO L93 Difference]: Finished difference Result 376 states and 415 transitions. [2024-09-12 17:56:35,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 67 [2024-09-12 17:56:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:35,912 INFO L225 Difference]: With dead ends: 376 [2024-09-12 17:56:35,912 INFO L226 Difference]: Without dead ends: 373 [2024-09-12 17:56:35,912 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:35,913 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 129 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:35,913 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 13 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-09-12 17:56:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 370. [2024-09-12 17:56:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 360 states have (on average 1.113888888888889) internal successors, (401), 366 states have internal predecessors, (401), 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 17:56:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 404 transitions. [2024-09-12 17:56:35,956 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 404 transitions. Word has length 67 [2024-09-12 17:56:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:35,956 INFO L474 AbstractCegarLoop]: Abstraction has 370 states and 404 transitions. [2024-09-12 17:56:35,956 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 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 17:56:35,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 404 transitions. [2024-09-12 17:56:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-12 17:56:35,957 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:35,957 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:35,957 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-09-12 17:56:35,957 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr40ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:35,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:35,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1431093843, now seen corresponding path program 1 times [2024-09-12 17:56:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:35,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909872764] [2024-09-12 17:56:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,028 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 17:56:36,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:36,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909872764] [2024-09-12 17:56:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909872764] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542231098] [2024-09-12 17:56:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:36,029 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:36,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:36,029 INFO L87 Difference]: Start difference. First operand 370 states and 404 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 17:56:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:36,294 INFO L93 Difference]: Finished difference Result 422 states and 468 transitions. [2024-09-12 17:56:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:36,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 68 [2024-09-12 17:56:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:36,295 INFO L225 Difference]: With dead ends: 422 [2024-09-12 17:56:36,295 INFO L226 Difference]: Without dead ends: 420 [2024-09-12 17:56:36,296 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:36,296 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:36,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 13 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-09-12 17:56:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 398. [2024-09-12 17:56:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.1134020618556701) internal successors, (432), 394 states have internal predecessors, (432), 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 17:56:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 435 transitions. [2024-09-12 17:56:36,349 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 435 transitions. Word has length 68 [2024-09-12 17:56:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:36,349 INFO L474 AbstractCegarLoop]: Abstraction has 398 states and 435 transitions. [2024-09-12 17:56:36,349 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 17:56:36,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 435 transitions. [2024-09-12 17:56:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-12 17:56:36,350 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:36,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:36,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-09-12 17:56:36,350 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr41ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:36,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1414239439, now seen corresponding path program 1 times [2024-09-12 17:56:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278911086] [2024-09-12 17:56:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:36,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,442 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 17:56:36,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278911086] [2024-09-12 17:56:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278911086] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:36,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:36,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201050130] [2024-09-12 17:56:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:36,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:36,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:36,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:36,444 INFO L87 Difference]: Start difference. First operand 398 states and 435 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 17:56:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:36,668 INFO L93 Difference]: Finished difference Result 398 states and 435 transitions. [2024-09-12 17:56:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:36,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 69 [2024-09-12 17:56:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:36,671 INFO L225 Difference]: With dead ends: 398 [2024-09-12 17:56:36,672 INFO L226 Difference]: Without dead ends: 396 [2024-09-12 17:56:36,672 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:36,672 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 89 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:36,673 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 13 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-09-12 17:56:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-09-12 17:56:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 387 states have (on average 1.1007751937984496) internal successors, (426), 392 states have internal predecessors, (426), 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 17:56:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 429 transitions. [2024-09-12 17:56:36,724 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 429 transitions. Word has length 69 [2024-09-12 17:56:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:36,724 INFO L474 AbstractCegarLoop]: Abstraction has 396 states and 429 transitions. [2024-09-12 17:56:36,725 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 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 17:56:36,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 429 transitions. [2024-09-12 17:56:36,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 17:56:36,726 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:36,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:36,726 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-09-12 17:56:36,726 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr34ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:36,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1866115177, now seen corresponding path program 1 times [2024-09-12 17:56:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:36,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588065463] [2024-09-12 17:56:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,867 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 17:56:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588065463] [2024-09-12 17:56:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588065463] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788762450] [2024-09-12 17:56:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:36,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:36,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:36,869 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 17:56:36,871 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 17:56:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:36,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 17:56:36,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:37,055 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 17:56:37,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:37,173 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 17:56:37,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788762450] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:37,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:37,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2024-09-12 17:56:37,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937371448] [2024-09-12 17:56:37,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:37,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:56:37,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:37,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:56:37,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:56:37,174 INFO L87 Difference]: Start difference. First operand 396 states and 429 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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 17:56:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:37,395 INFO L93 Difference]: Finished difference Result 396 states and 429 transitions. [2024-09-12 17:56:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:37,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2024-09-12 17:56:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:37,397 INFO L225 Difference]: With dead ends: 396 [2024-09-12 17:56:37,397 INFO L226 Difference]: Without dead ends: 394 [2024-09-12 17:56:37,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 137 SyntacticMatches, 10 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:56:37,399 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:37,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 16 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-09-12 17:56:37,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-09-12 17:56:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 386 states have (on average 1.0803108808290156) internal successors, (417), 390 states have internal predecessors, (417), 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 17:56:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 420 transitions. [2024-09-12 17:56:37,456 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 420 transitions. Word has length 72 [2024-09-12 17:56:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:37,456 INFO L474 AbstractCegarLoop]: Abstraction has 394 states and 420 transitions. [2024-09-12 17:56:37,456 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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 17:56:37,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 420 transitions. [2024-09-12 17:56:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-09-12 17:56:37,459 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:37,459 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 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 17:56:37,471 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 17:56:37,659 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:37,659 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:37,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1707351330, now seen corresponding path program 2 times [2024-09-12 17:56:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:37,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159881744] [2024-09-12 17:56:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:37,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159881744] [2024-09-12 17:56:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159881744] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529692562] [2024-09-12 17:56:37,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:56:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:37,747 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 17:56:37,748 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 17:56:37,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:56:37,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:56:37,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 17:56:37,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-12 17:56:37,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-12 17:56:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529692562] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:37,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2024-09-12 17:56:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526776188] [2024-09-12 17:56:37,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:37,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 17:56:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 17:56:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-09-12 17:56:37,965 INFO L87 Difference]: Start difference. First operand 394 states and 420 transitions. Second operand has 14 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 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 17:56:38,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:38,411 INFO L93 Difference]: Finished difference Result 575 states and 620 transitions. [2024-09-12 17:56:38,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 17:56:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 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 75 [2024-09-12 17:56:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:38,414 INFO L225 Difference]: With dead ends: 575 [2024-09-12 17:56:38,414 INFO L226 Difference]: Without dead ends: 572 [2024-09-12 17:56:38,414 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2024-09-12 17:56:38,415 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 988 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:38,415 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 13 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-09-12 17:56:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 300. [2024-09-12 17:56:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 294 states have (on average 1.1020408163265305) internal successors, (324), 296 states have internal predecessors, (324), 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 17:56:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 327 transitions. [2024-09-12 17:56:38,476 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 327 transitions. Word has length 75 [2024-09-12 17:56:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:38,476 INFO L474 AbstractCegarLoop]: Abstraction has 300 states and 327 transitions. [2024-09-12 17:56:38,476 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 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 17:56:38,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 327 transitions. [2024-09-12 17:56:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-12 17:56:38,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:38,477 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:38,489 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 17:56:38,678 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-09-12 17:56:38,678 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr40ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:38,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash -452662537, now seen corresponding path program 1 times [2024-09-12 17:56:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768580942] [2024-09-12 17:56:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:38,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 17:56:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768580942] [2024-09-12 17:56:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768580942] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:38,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:38,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646586815] [2024-09-12 17:56:38,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:38,767 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:38,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:38,768 INFO L87 Difference]: Start difference. First operand 300 states and 327 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 17:56:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:39,047 INFO L93 Difference]: Finished difference Result 304 states and 331 transitions. [2024-09-12 17:56:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:39,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 79 [2024-09-12 17:56:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:39,049 INFO L225 Difference]: With dead ends: 304 [2024-09-12 17:56:39,049 INFO L226 Difference]: Without dead ends: 302 [2024-09-12 17:56:39,050 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:39,050 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 143 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:39,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 13 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-09-12 17:56:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2024-09-12 17:56:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.082437275985663) internal successors, (302), 280 states have internal predecessors, (302), 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 17:56:39,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 305 transitions. [2024-09-12 17:56:39,102 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 305 transitions. Word has length 79 [2024-09-12 17:56:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:39,103 INFO L474 AbstractCegarLoop]: Abstraction has 284 states and 305 transitions. [2024-09-12 17:56:39,103 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 17:56:39,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 305 transitions. [2024-09-12 17:56:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-12 17:56:39,104 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:39,104 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:39,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-09-12 17:56:39,104 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:39,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1319013956, now seen corresponding path program 1 times [2024-09-12 17:56:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233409876] [2024-09-12 17:56:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:39,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:39,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233409876] [2024-09-12 17:56:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233409876] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:39,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775839855] [2024-09-12 17:56:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:39,159 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 17:56:39,160 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 17:56:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:39,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 17:56:39,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:39,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:39,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:39,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775839855] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:39,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:39,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-09-12 17:56:39,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612439155] [2024-09-12 17:56:39,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:39,308 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:56:39,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:39,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:56:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:56:39,308 INFO L87 Difference]: Start difference. First operand 284 states and 305 transitions. Second operand has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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 17:56:39,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:39,540 INFO L93 Difference]: Finished difference Result 511 states and 554 transitions. [2024-09-12 17:56:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:39,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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 81 [2024-09-12 17:56:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:39,542 INFO L225 Difference]: With dead ends: 511 [2024-09-12 17:56:39,542 INFO L226 Difference]: Without dead ends: 510 [2024-09-12 17:56:39,542 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:56:39,543 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 176 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:39,543 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 7 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2024-09-12 17:56:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 506. [2024-09-12 17:56:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 501 states have (on average 1.0698602794411178) internal successors, (536), 502 states have internal predecessors, (536), 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 17:56:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 539 transitions. [2024-09-12 17:56:39,623 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 539 transitions. Word has length 81 [2024-09-12 17:56:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:39,623 INFO L474 AbstractCegarLoop]: Abstraction has 506 states and 539 transitions. [2024-09-12 17:56:39,623 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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 17:56:39,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 539 transitions. [2024-09-12 17:56:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-09-12 17:56:39,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:39,625 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:39,638 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 17:56:39,825 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-09-12 17:56:39,826 INFO L399 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:39,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:39,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1598674134, now seen corresponding path program 1 times [2024-09-12 17:56:39,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:39,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116090260] [2024-09-12 17:56:39,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:39,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:39,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116090260] [2024-09-12 17:56:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116090260] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961034589] [2024-09-12 17:56:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:39,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:56:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 17:56:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:40,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 17:56:40,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:40,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961034589] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:40,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:40,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2024-09-12 17:56:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403508988] [2024-09-12 17:56:40,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:40,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 17:56:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 17:56:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=326, Unknown=0, NotChecked=0, Total=506 [2024-09-12 17:56:40,325 INFO L87 Difference]: Start difference. First operand 506 states and 539 transitions. Second operand has 23 states, 22 states have (on average 14.0) internal successors, (308), 22 states have internal predecessors, (308), 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 17:56:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:42,084 INFO L93 Difference]: Finished difference Result 5008 states and 5350 transitions. [2024-09-12 17:56:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 17:56:42,085 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 14.0) internal successors, (308), 22 states have internal predecessors, (308), 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 127 [2024-09-12 17:56:42,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:42,096 INFO L225 Difference]: With dead ends: 5008 [2024-09-12 17:56:42,096 INFO L226 Difference]: Without dead ends: 5007 [2024-09-12 17:56:42,098 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=565, Invalid=1157, Unknown=0, NotChecked=0, Total=1722 [2024-09-12 17:56:42,098 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 2763 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:42,098 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 25 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 17:56:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2024-09-12 17:56:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 1616. [2024-09-12 17:56:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1611 states have (on average 1.0651769087523277) internal successors, (1716), 1612 states have internal predecessors, (1716), 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 17:56:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1719 transitions. [2024-09-12 17:56:42,535 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1719 transitions. Word has length 127 [2024-09-12 17:56:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:42,536 INFO L474 AbstractCegarLoop]: Abstraction has 1616 states and 1719 transitions. [2024-09-12 17:56:42,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 14.0) internal successors, (308), 22 states have internal predecessors, (308), 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 17:56:42,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1719 transitions. [2024-09-12 17:56:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-12 17:56:42,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:42,538 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:42,550 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 17:56:42,741 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:42,742 INFO L399 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:42,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1167700501, now seen corresponding path program 2 times [2024-09-12 17:56:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286300893] [2024-09-12 17:56:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:42,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-12 17:56:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:42,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286300893] [2024-09-12 17:56:42,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286300893] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:42,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294645459] [2024-09-12 17:56:42,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:56:42,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:42,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:42,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:56:42,818 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 17:56:42,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:56:42,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:56:42,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 17:56:42,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-12 17:56:42,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-12 17:56:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294645459] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:43,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2024-09-12 17:56:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845046607] [2024-09-12 17:56:43,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:43,092 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:43,092 INFO L87 Difference]: Start difference. First operand 1616 states and 1719 transitions. Second operand has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 17:56:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:43,656 INFO L93 Difference]: Finished difference Result 2057 states and 2163 transitions. [2024-09-12 17:56:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 132 [2024-09-12 17:56:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:43,662 INFO L225 Difference]: With dead ends: 2057 [2024-09-12 17:56:43,662 INFO L226 Difference]: Without dead ends: 2056 [2024-09-12 17:56:43,662 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:56:43,663 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 123 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:43,663 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 13 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2024-09-12 17:56:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 673. [2024-09-12 17:56:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 669 states have (on average 1.0448430493273542) internal successors, (699), 669 states have internal predecessors, (699), 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 17:56:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 702 transitions. [2024-09-12 17:56:43,865 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 702 transitions. Word has length 132 [2024-09-12 17:56:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:43,865 INFO L474 AbstractCegarLoop]: Abstraction has 673 states and 702 transitions. [2024-09-12 17:56:43,866 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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 17:56:43,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 702 transitions. [2024-09-12 17:56:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-09-12 17:56:43,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:43,868 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:43,881 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-12 17:56:44,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:44,069 INFO L399 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 45 more)] === [2024-09-12 17:56:44,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash 986915326, now seen corresponding path program 2 times [2024-09-12 17:56:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:44,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343048968] [2024-09-12 17:56:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:44,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:44,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343048968] [2024-09-12 17:56:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343048968] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:44,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911015578] [2024-09-12 17:56:44,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:56:44,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:44,440 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:56:44,440 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-12 17:56:44,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:56:44,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:56:44,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 17:56:44,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-09-12 17:56:44,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-09-12 17:56:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911015578] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:44,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:44,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 4, 4] total 25 [2024-09-12 17:56:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793014621] [2024-09-12 17:56:44,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:44,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 17:56:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 17:56:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=409, Unknown=0, NotChecked=0, Total=650 [2024-09-12 17:56:44,888 INFO L87 Difference]: Start difference. First operand 673 states and 702 transitions. Second operand has 26 states, 25 states have (on average 13.32) internal successors, (333), 25 states have internal predecessors, (333), 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 17:56:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:46,618 INFO L93 Difference]: Finished difference Result 1029 states and 1066 transitions. [2024-09-12 17:56:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-12 17:56:46,618 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 13.32) internal successors, (333), 25 states have internal predecessors, (333), 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 207 [2024-09-12 17:56:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:46,620 INFO L225 Difference]: With dead ends: 1029 [2024-09-12 17:56:46,620 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 17:56:46,623 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1448, Invalid=2842, Unknown=0, NotChecked=0, Total=4290 [2024-09-12 17:56:46,624 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 2139 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2139 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:46,624 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2139 Valid, 19 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 17:56:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 17:56:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 17:56:46,624 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 17:56:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 17:56:46,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2024-09-12 17:56:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:46,625 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 17:56:46,627 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 13.32) internal successors, (333), 25 states have internal predecessors, (333), 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 17:56:46,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 17:56:46,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 17:56:46,630 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 48 remaining) [2024-09-12 17:56:46,630 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 48 remaining) [2024-09-12 17:56:46,630 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 48 remaining) [2024-09-12 17:56:46,630 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 48 remaining) [2024-09-12 17:56:46,630 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (43 of 48 remaining) [2024-09-12 17:56:46,630 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 48 remaining) [2024-09-12 17:56:46,631 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 48 remaining) [2024-09-12 17:56:46,631 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (40 of 48 remaining) [2024-09-12 17:56:46,631 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (39 of 48 remaining) [2024-09-12 17:56:46,631 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (38 of 48 remaining) [2024-09-12 17:56:46,631 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 48 remaining) [2024-09-12 17:56:46,631 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 48 remaining) [2024-09-12 17:56:46,632 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (35 of 48 remaining) [2024-09-12 17:56:46,632 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (34 of 48 remaining) [2024-09-12 17:56:46,632 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr18ASSERT_VIOLATIONERROR_FUNCTION (29 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr21ASSERT_VIOLATIONERROR_FUNCTION (26 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr28ASSERT_VIOLATIONERROR_FUNCTION (19 of 48 remaining) [2024-09-12 17:56:46,633 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr29ASSERT_VIOLATIONERROR_FUNCTION (18 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr34ASSERT_VIOLATIONERROR_FUNCTION (13 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr35ASSERT_VIOLATIONERROR_FUNCTION (12 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr38ASSERT_VIOLATIONERROR_FUNCTION (9 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr39ASSERT_VIOLATIONERROR_FUNCTION (8 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr40ASSERT_VIOLATIONERROR_FUNCTION (7 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr41ASSERT_VIOLATIONERROR_FUNCTION (6 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 48 remaining) [2024-09-12 17:56:46,634 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr44ASSERT_VIOLATIONERROR_FUNCTION (3 of 48 remaining) [2024-09-12 17:56:46,635 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr45ASSERT_VIOLATIONERROR_FUNCTION (2 of 48 remaining) [2024-09-12 17:56:46,635 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 48 remaining) [2024-09-12 17:56:46,635 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 48 remaining) [2024-09-12 17:56:46,649 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-12 17:56:46,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-09-12 17:56:46,838 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:46,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 17:57:57,849 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 17:57:57,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 05:57:57 BoogieIcfgContainer [2024-09-12 17:57:57,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 17:57:57,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 17:57:57,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 17:57:57,865 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 17:57:57,866 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:56:26" (3/4) ... [2024-09-12 17:57:57,867 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 17:57:57,870 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 17:57:57,870 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 17:57:57,875 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-12 17:57:57,875 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 17:57:57,876 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 17:57:57,876 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 17:57:57,895 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(__return_375) == __return_375) [2024-09-12 17:57:57,895 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (\old(__return_375) == __return_375)) && (main__tokenlen <= 1000000)) && (main__urilen <= 1000000)) && (1 <= main__cp)) [2024-09-12 17:57:57,896 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((main__urilen == ((long long) main__cp + 1)) && (\old(__return_375) == __return_375)) && (main__urilen <= 2147483647)) && (1 <= main__cp)) || ((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (\old(__return_375) == __return_375)) && (main__tokenlen <= 1000000)) && (main__urilen <= 1000000)) && (1 <= main__cp))) [2024-09-12 17:57:57,896 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(__return_375) == __return_375) && (((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (main__c <= 2147483646)) && (1 <= main__c)) && (main__tokenlen <= 1000000)) && (1 <= main__cp)) || (((main__tokenlen <= 1000000) && (((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (main__urilen != ((long long) main__cp + 1))) && (1 <= main__cp)) || (((2 <= main__tokenlen) && (((long long) main__cp + 1) <= main__urilen)) && (1 <= main__cp)))) && (main__c == 0)))) && (main__urilen <= 1000000)) [2024-09-12 17:57:57,897 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (main__urilen != ((long long) main__cp + 1))) && (main__c <= 2147483646)) && (1 <= main__c)) && (main__tokenlen <= 1000000)) && (1 <= main__cp)) || ((((((2 <= main__tokenlen) && (((long long) main__cp + 1) <= main__urilen)) && (main__urilen != ((long long) main__cp + 1))) && (main__tokenlen <= 1000000)) && (main__c == 0)) && (1 <= main__cp))) && (\old(__return_375) == __return_375)) && (main__urilen <= 1000000)) [2024-09-12 17:57:57,956 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 17:57:57,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 17:57:57,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 17:57:57,957 INFO L158 Benchmark]: Toolchain (without parser) took 92711.25ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 67.5MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 197.4MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,958 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:57:57,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.56ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 68.3MB in the end (delta: -798.4kB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.93ms. Allocated memory is still 90.2MB. Free memory was 68.3MB in the beginning and 66.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,958 INFO L158 Benchmark]: Boogie Preprocessor took 36.69ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 64.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,958 INFO L158 Benchmark]: RCFGBuilder took 488.48ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 67.2MB in the end (delta: -3.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,958 INFO L158 Benchmark]: TraceAbstraction took 91723.53ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 66.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 930.5MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,959 INFO L158 Benchmark]: Witness Printer took 91.82ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-12 17:57:57,959 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.54ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.56ms. Allocated memory is still 90.2MB. Free memory was 67.5MB in the beginning and 68.3MB in the end (delta: -798.4kB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.93ms. Allocated memory is still 90.2MB. Free memory was 68.3MB in the beginning and 66.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.69ms. Allocated memory is still 90.2MB. Free memory was 66.5MB in the beginning and 64.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 488.48ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 67.2MB in the end (delta: -3.0MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 91723.53ms. Allocated memory was 90.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 66.7MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 930.5MB. Max. memory is 16.1GB. * Witness Printer took 91.82ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: 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: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: 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: 113]: 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: 125]: 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: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: 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: 157]: 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: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: 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: 184]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 184]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 189]: 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: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: 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: 226]: 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: 232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 234]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 234]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 243]: 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: 255]: 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: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 272]: 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: 284]: 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: 296]: 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: 308]: 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: 314]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 314]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 374]: 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: 386]: 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: 391]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 391]: 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, 145 locations, 48 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 36, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12540 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12540 mSDsluCounter, 437 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12165 IncrementalHoareTripleChecker+Invalid, 12441 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 111 mSDtfsCounter, 12165 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2054 GetRequests, 1686 SyntacticMatches, 21 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1616occurred in iteration=34, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 5389 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2830 NumberOfCodeBlocks, 2579 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3596 ConstructedInterpolants, 0 QuantifiedInterpolants, 10435 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1526 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 54 InterpolantComputations, 27 PerfectInterpolantSequences, 1853/3366 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 48 specifications checked. All of them hold - InvariantResult [Line: 262]: Location Invariant Derived location invariant: ((((((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (main__urilen != ((long long) main__cp + 1))) && (main__c <= 2147483646)) && (1 <= main__c)) && (main__tokenlen <= 1000000)) && (1 <= main__cp)) || ((((((2 <= main__tokenlen) && (((long long) main__cp + 1) <= main__urilen)) && (main__urilen != ((long long) main__cp + 1))) && (main__tokenlen <= 1000000)) && (main__c == 0)) && (1 <= main__cp))) && (\old(__return_375) == __return_375)) && (main__urilen <= 1000000)) - InvariantResult [Line: 230]: Location Invariant Derived location invariant: (((\old(__return_375) == __return_375) && (((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (main__c <= 2147483646)) && (1 <= main__c)) && (main__tokenlen <= 1000000)) && (1 <= main__cp)) || (((main__tokenlen <= 1000000) && (((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (main__urilen != ((long long) main__cp + 1))) && (1 <= main__cp)) || (((2 <= main__tokenlen) && (((long long) main__cp + 1) <= main__urilen)) && (1 <= main__cp)))) && (main__c == 0)))) && (main__urilen <= 1000000)) - InvariantResult [Line: 131]: Location Invariant Derived location invariant: (((((main__urilen == ((long long) main__cp + 1)) && (\old(__return_375) == __return_375)) && (main__urilen <= 2147483647)) && (1 <= main__cp)) || ((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (\old(__return_375) == __return_375)) && (main__tokenlen <= 1000000)) && (main__urilen <= 1000000)) && (1 <= main__cp))) - InvariantResult [Line: 162]: Location Invariant Derived location invariant: (\old(__return_375) == __return_375) - InvariantResult [Line: 129]: Location Invariant Derived location invariant: ((((((((long long) main__cp + 1) <= main__urilen) && (0 <= (1000000 + main__tokenlen))) && (\old(__return_375) == __return_375)) && (main__tokenlen <= 1000000)) && (main__urilen <= 1000000)) && (1 <= main__cp)) RESULT: Ultimate proved your program to be correct! [2024-09-12 17:57:57,982 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE