./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.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/SpamAssassin-loop.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 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --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:02,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:56:02,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:56:02,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:56:02,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:56:02,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:56:02,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:56:02,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:56:02,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:56:02,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:56:02,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:56:02,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:56:02,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:56:02,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:56:02,722 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:56:02,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:56:02,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:56:02,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:56:02,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:56:02,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:56:02,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:56:02,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:56:02,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:56:02,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:56:02,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:56:02,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:56:02,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:56:02,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:56:02,728 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:56:02,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:56:02,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:56:02,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:56:02,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:56:02,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:56:02,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:56:02,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:56:02,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:56:02,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:56:02,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:56:02,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:56:02,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:56:02,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:56:02,733 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 -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 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:03,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:56:03,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:56:03,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:56:03,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:56:03,069 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:56:03,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-09-12 17:56:04,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:56:04,784 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:56:04,785 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-09-12 17:56:04,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/446a370ca/d088b19ee93f4b7c959adb89a7c16f6b/FLAG47c09ff70 [2024-09-12 17:56:05,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/446a370ca/d088b19ee93f4b7c959adb89a7c16f6b [2024-09-12 17:56:05,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:56:05,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:56:05,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:56:05,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:56:05,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:56:05,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:56:05" (1/1) ... [2024-09-12 17:56:05,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c05dda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:05, skipping insertion in model container [2024-09-12 17:56:05,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:56:05" (1/1) ... [2024-09-12 17:56:05,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:56:05,376 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-09-12 17:56:05,382 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-09-12 17:56:05,385 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-09-12 17:56:05,387 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-09-12 17:56:05,391 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-09-12 17:56:05,392 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-09-12 17:56:05,395 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-09-12 17:56:05,396 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-09-12 17:56:05,397 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-09-12 17:56:05,398 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-09-12 17:56:05,400 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-09-12 17:56:05,401 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-09-12 17:56:05,402 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-09-12 17:56:05,404 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-09-12 17:56:05,406 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-09-12 17:56:05,409 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-09-12 17:56:05,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:56:05,426 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-09-12 17:56:05,442 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-09-12 17:56:05,453 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-09-12 17:56:05,458 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-09-12 17:56:05,459 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-09-12 17:56:05,463 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-09-12 17:56:05,467 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-09-12 17:56:05,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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-09-12 17:56:05,472 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-09-12 17:56:05,476 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-09-12 17:56:05,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:56:05,504 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:56:05,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:05 WrapperNode [2024-09-12 17:56:05,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:56:05,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:56:05,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:56:05,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:56:05,513 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:05" (1/1) ... [2024-09-12 17:56:05,519 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:05" (1/1) ... [2024-09-12 17:56:05,529 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:56:05,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:56:05,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:56:05,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:56:05,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:56:05,544 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:05" (1/1) ... [2024-09-12 17:56:05,545 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:05" (1/1) ... [2024-09-12 17:56:05,551 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:05" (1/1) ... [2024-09-12 17:56:05,575 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:05,575 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:05" (1/1) ... [2024-09-12 17:56:05,576 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:05" (1/1) ... [2024-09-12 17:56:05,581 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:05" (1/1) ... [2024-09-12 17:56:05,588 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:05" (1/1) ... [2024-09-12 17:56:05,589 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:05" (1/1) ... [2024-09-12 17:56:05,593 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:05" (1/1) ... [2024-09-12 17:56:05,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:56:05,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:56:05,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:56:05,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:56:05,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:05" (1/1) ... [2024-09-12 17:56:05,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:56:05,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:05,639 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:05,647 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:05,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:56:05,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:56:05,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:56:05,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:56:05,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:56:05,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:56:05,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:56:05,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:56:05,766 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:56:05,767 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:56:06,067 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-09-12 17:56:06,068 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:56:06,098 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:56:06,098 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 17:56:06,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:56:06 BoogieIcfgContainer [2024-09-12 17:56:06,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:56:06,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:56:06,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:56:06,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:56:06,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:56:05" (1/3) ... [2024-09-12 17:56:06,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769db050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:56:06, skipping insertion in model container [2024-09-12 17:56:06,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:56:05" (2/3) ... [2024-09-12 17:56:06,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769db050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:56:06, skipping insertion in model container [2024-09-12 17:56:06,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:56:06" (3/3) ... [2024-09-12 17:56:06,109 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2024-09-12 17:56:06,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:56:06,125 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-09-12 17:56:06,206 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:56:06,215 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;@16e0c657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:56:06,215 INFO L337 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-09-12 17:56:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 63 states have (on average 1.9206349206349207) internal successors, (121), 99 states have internal predecessors, (121), 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:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-12 17:56:06,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:06,228 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:06,229 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:06,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1890891520, now seen corresponding path program 1 times [2024-09-12 17:56:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641811325] [2024-09-12 17:56:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:06,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:06,482 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:06,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:06,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641811325] [2024-09-12 17:56:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641811325] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:06,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:06,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:06,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292669586] [2024-09-12 17:56:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:06,491 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:06,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:06,517 INFO L87 Difference]: Start difference. First operand has 104 states, 63 states have (on average 1.9206349206349207) internal successors, (121), 99 states have internal predecessors, (121), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:06,807 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2024-09-12 17:56:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 7 [2024-09-12 17:56:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:06,819 INFO L225 Difference]: With dead ends: 110 [2024-09-12 17:56:06,819 INFO L226 Difference]: Without dead ends: 99 [2024-09-12 17:56:06,822 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:06,825 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 199 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:06,833 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 15 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-12 17:56:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-09-12 17:56:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.639344262295082) internal successors, (100), 95 states have internal predecessors, (100), 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:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-09-12 17:56:06,888 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 7 [2024-09-12 17:56:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:06,890 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-09-12 17:56:06,890 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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:06,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-09-12 17:56:06,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 17:56:06,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:06,892 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:06,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:56:06,893 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:06,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1511904981, now seen corresponding path program 1 times [2024-09-12 17:56:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666563457] [2024-09-12 17:56:06,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:06,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:06,970 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:06,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:06,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666563457] [2024-09-12 17:56:06,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666563457] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:06,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123480404] [2024-09-12 17:56:06,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:06,975 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:06,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:06,977 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:07,146 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2024-09-12 17:56:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 17:56:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:07,149 INFO L225 Difference]: With dead ends: 99 [2024-09-12 17:56:07,149 INFO L226 Difference]: Without dead ends: 98 [2024-09-12 17:56:07,149 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:07,150 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 193 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:07,150 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 7 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-12 17:56:07,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-09-12 17:56:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 94 states have internal predecessors, (99), 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:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2024-09-12 17:56:07,197 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 8 [2024-09-12 17:56:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:07,197 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2024-09-12 17:56:07,198 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:07,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2024-09-12 17:56:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:56:07,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:07,199 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:07,199 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:56:07,199 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:07,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash 689553233, now seen corresponding path program 1 times [2024-09-12 17:56:07,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:07,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769540706] [2024-09-12 17:56:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:07,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:07,286 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:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769540706] [2024-09-12 17:56:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769540706] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:07,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516400783] [2024-09-12 17:56:07,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:07,291 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:07,294 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:07,583 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2024-09-12 17:56:07,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 17:56:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:07,588 INFO L225 Difference]: With dead ends: 158 [2024-09-12 17:56:07,588 INFO L226 Difference]: Without dead ends: 150 [2024-09-12 17:56:07,589 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:07,590 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 205 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:07,592 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 7 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-09-12 17:56:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2024-09-12 17:56:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 122 states have internal predecessors, (145), 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:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2024-09-12 17:56:07,628 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 12 [2024-09-12 17:56:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:07,628 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2024-09-12 17:56:07,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:07,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2024-09-12 17:56:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 17:56:07,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:07,630 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:07,630 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 17:56:07,631 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:07,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash 434844374, now seen corresponding path program 1 times [2024-09-12 17:56:07,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:07,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46599938] [2024-09-12 17:56:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:07,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:07,765 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:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:07,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46599938] [2024-09-12 17:56:07,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46599938] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:07,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:07,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:07,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679519545] [2024-09-12 17:56:07,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:07,767 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:07,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:07,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:07,768 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:08,013 INFO L93 Difference]: Finished difference Result 245 states and 291 transitions. [2024-09-12 17:56:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:08,015 INFO L225 Difference]: With dead ends: 245 [2024-09-12 17:56:08,015 INFO L226 Difference]: Without dead ends: 127 [2024-09-12 17:56:08,016 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:08,017 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:08,017 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 10 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-09-12 17:56:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-09-12 17:56:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 89 states have (on average 1.595505617977528) internal successors, (142), 121 states have internal predecessors, (142), 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:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 145 transitions. [2024-09-12 17:56:08,060 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 145 transitions. Word has length 17 [2024-09-12 17:56:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:08,062 INFO L474 AbstractCegarLoop]: Abstraction has 125 states and 145 transitions. [2024-09-12 17:56:08,062 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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:08,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2024-09-12 17:56:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:56:08,063 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:08,063 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:08,063 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:56:08,064 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:08,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 595276806, now seen corresponding path program 1 times [2024-09-12 17:56:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870838172] [2024-09-12 17:56:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:08,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:08,172 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:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870838172] [2024-09-12 17:56:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870838172] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297984804] [2024-09-12 17:56:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:08,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:08,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:08,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:08,175 INFO L87 Difference]: Start difference. First operand 125 states and 145 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:08,376 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2024-09-12 17:56:08,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:08,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2024-09-12 17:56:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:08,378 INFO L225 Difference]: With dead ends: 125 [2024-09-12 17:56:08,378 INFO L226 Difference]: Without dead ends: 118 [2024-09-12 17:56:08,378 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:08,379 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:08,379 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 10 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-12 17:56:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-09-12 17:56:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 114 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:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-09-12 17:56:08,421 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 137 transitions. Word has length 18 [2024-09-12 17:56:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:08,421 INFO L474 AbstractCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-09-12 17:56:08,421 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2024-09-12 17:56:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:56:08,423 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:08,423 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:08,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:56:08,424 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:08,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash 467242040, now seen corresponding path program 1 times [2024-09-12 17:56:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230475590] [2024-09-12 17:56:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:08,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:08,507 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:08,510 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:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230475590] [2024-09-12 17:56:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230475590] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:08,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296133964] [2024-09-12 17:56:08,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:08,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:08,513 INFO L87 Difference]: Start difference. First operand 118 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:08,772 INFO L93 Difference]: Finished difference Result 142 states and 166 transitions. [2024-09-12 17:56:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2024-09-12 17:56:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:08,774 INFO L225 Difference]: With dead ends: 142 [2024-09-12 17:56:08,774 INFO L226 Difference]: Without dead ends: 140 [2024-09-12 17:56:08,774 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:08,775 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:08,775 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 10 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-12 17:56:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2024-09-12 17:56:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 112 states have internal predecessors, (131), 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:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2024-09-12 17:56:08,797 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 18 [2024-09-12 17:56:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:08,797 INFO L474 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2024-09-12 17:56:08,797 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:08,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2024-09-12 17:56:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:56:08,798 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:08,798 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:08,799 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:56:08,799 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:08,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1273714908, now seen corresponding path program 1 times [2024-09-12 17:56:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:08,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201680199] [2024-09-12 17:56:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:08,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:08,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:08,904 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:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201680199] [2024-09-12 17:56:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201680199] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115358176] [2024-09-12 17:56:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:08,908 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:08,909 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:09,127 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2024-09-12 17:56:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:09,129 INFO L225 Difference]: With dead ends: 116 [2024-09-12 17:56:09,129 INFO L226 Difference]: Without dead ends: 114 [2024-09-12 17:56:09,129 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:09,130 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 194 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:09,130 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 13 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-09-12 17:56:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-09-12 17:56:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 110 states have internal predecessors, (128), 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:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-09-12 17:56:09,161 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 19 [2024-09-12 17:56:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:09,161 INFO L474 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-09-12 17:56:09,162 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:09,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-09-12 17:56:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:56:09,163 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:09,163 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:09,163 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 17:56:09,163 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:09,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1599604435, now seen corresponding path program 1 times [2024-09-12 17:56:09,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938588229] [2024-09-12 17:56:09,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:09,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:09,244 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:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938588229] [2024-09-12 17:56:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938588229] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:09,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796868589] [2024-09-12 17:56:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:09,247 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:09,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:09,250 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:09,423 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2024-09-12 17:56:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-12 17:56:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:09,424 INFO L225 Difference]: With dead ends: 114 [2024-09-12 17:56:09,424 INFO L226 Difference]: Without dead ends: 112 [2024-09-12 17:56:09,425 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:09,425 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 146 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:09,426 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 10 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-12 17:56:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-09-12 17:56:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 108 states have internal predecessors, (125), 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:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-09-12 17:56:09,453 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 19 [2024-09-12 17:56:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:09,453 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-09-12 17:56:09,453 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:09,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-09-12 17:56:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:56:09,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:09,454 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:09,454 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 17:56:09,454 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:09,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash 830459596, now seen corresponding path program 1 times [2024-09-12 17:56:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327421383] [2024-09-12 17:56:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:09,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:09,518 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:09,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327421383] [2024-09-12 17:56:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327421383] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:09,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:09,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:09,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382178647] [2024-09-12 17:56:09,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:09,521 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:09,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:09,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:09,522 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.4) 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:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:09,691 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2024-09-12 17:56:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:09,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) 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:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:09,693 INFO L225 Difference]: With dead ends: 113 [2024-09-12 17:56:09,693 INFO L226 Difference]: Without dead ends: 107 [2024-09-12 17:56:09,693 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:09,694 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 132 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:09,696 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 10 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-12 17:56:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-09-12 17:56:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.380952380952381) internal successors, (116), 102 states have internal predecessors, (116), 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:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2024-09-12 17:56:09,713 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 20 [2024-09-12 17:56:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:09,715 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2024-09-12 17:56:09,715 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) 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:09,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2024-09-12 17:56:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:56:09,717 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:09,717 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] [2024-09-12 17:56:09,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 17:56:09,717 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:09,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash -25553214, now seen corresponding path program 1 times [2024-09-12 17:56:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263042964] [2024-09-12 17:56:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:09,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:09,754 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:09,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:09,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263042964] [2024-09-12 17:56:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263042964] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:56:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551097938] [2024-09-12 17:56:09,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:09,756 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:56:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:56:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:56:09,757 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:09,939 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2024-09-12 17:56:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:56:09,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2024-09-12 17:56:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:09,941 INFO L225 Difference]: With dead ends: 140 [2024-09-12 17:56:09,941 INFO L226 Difference]: Without dead ends: 138 [2024-09-12 17:56:09,941 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:09,942 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:09,942 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 7 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-12 17:56:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-09-12 17:56:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 124 states have internal predecessors, (145), 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:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2024-09-12 17:56:09,967 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 21 [2024-09-12 17:56:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:09,968 INFO L474 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2024-09-12 17:56:09,968 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:09,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2024-09-12 17:56:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:56:09,972 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:09,972 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] [2024-09-12 17:56:09,972 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 17:56:09,972 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:09,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash -378297317, now seen corresponding path program 1 times [2024-09-12 17:56:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027989570] [2024-09-12 17:56:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,036 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:10,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:10,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027989570] [2024-09-12 17:56:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027989570] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:10,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:10,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727592811] [2024-09-12 17:56:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:10,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:10,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:10,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:10,038 INFO L87 Difference]: Start difference. First operand 128 states and 148 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:10,232 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2024-09-12 17:56:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2024-09-12 17:56:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:10,234 INFO L225 Difference]: With dead ends: 130 [2024-09-12 17:56:10,234 INFO L226 Difference]: Without dead ends: 128 [2024-09-12 17:56:10,234 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:10,235 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:10,235 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 10 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-12 17:56:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-09-12 17:56:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 122 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:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-09-12 17:56:10,268 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 21 [2024-09-12 17:56:10,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:10,268 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-09-12 17:56:10,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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:10,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-09-12 17:56:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 17:56:10,270 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:10,270 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:10,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 17:56:10,270 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:10,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1157688196, now seen corresponding path program 1 times [2024-09-12 17:56:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:10,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901885172] [2024-09-12 17:56:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:10,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,342 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:10,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901885172] [2024-09-12 17:56:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901885172] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:10,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347417599] [2024-09-12 17:56:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:10,344 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:10,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:10,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:10,344 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:10,535 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2024-09-12 17:56:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:10,536 INFO L225 Difference]: With dead ends: 126 [2024-09-12 17:56:10,537 INFO L226 Difference]: Without dead ends: 124 [2024-09-12 17:56:10,537 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:10,537 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 132 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:10,538 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 13 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-09-12 17:56:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-09-12 17:56:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 120 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:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2024-09-12 17:56:10,565 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 22 [2024-09-12 17:56:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:10,565 INFO L474 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2024-09-12 17:56:10,565 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:10,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2024-09-12 17:56:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 17:56:10,566 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:10,567 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] [2024-09-12 17:56:10,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 17:56:10,567 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr18ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:10,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1528598849, now seen corresponding path program 1 times [2024-09-12 17:56:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:10,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087132907] [2024-09-12 17:56:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,636 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:10,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:10,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087132907] [2024-09-12 17:56:10,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087132907] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:10,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:10,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140233724] [2024-09-12 17:56:10,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:10,638 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:10,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:10,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:10,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:10,639 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:10,808 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-09-12 17:56:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:10,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-09-12 17:56:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:10,811 INFO L225 Difference]: With dead ends: 124 [2024-09-12 17:56:10,811 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 17:56:10,811 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:10,812 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:10,812 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 13 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 17:56:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-09-12 17:56:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 118 states have internal predecessors, (133), 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:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2024-09-12 17:56:10,837 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 23 [2024-09-12 17:56:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:10,837 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2024-09-12 17:56:10,837 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:10,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2024-09-12 17:56:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 17:56:10,838 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:10,838 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] [2024-09-12 17:56:10,838 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 17:56:10,838 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr19ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:10,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 141927210, now seen corresponding path program 1 times [2024-09-12 17:56:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:10,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728769758] [2024-09-12 17:56:10,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:10,912 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:10,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:10,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728769758] [2024-09-12 17:56:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728769758] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:10,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:10,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:10,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689828733] [2024-09-12 17:56:10,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:10,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:10,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:10,915 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:11,041 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2024-09-12 17:56:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 24 [2024-09-12 17:56:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:11,043 INFO L225 Difference]: With dead ends: 123 [2024-09-12 17:56:11,043 INFO L226 Difference]: Without dead ends: 121 [2024-09-12 17:56:11,043 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:11,044 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:11,044 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 10 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-09-12 17:56:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-09-12 17:56:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 116 states have internal predecessors, (129), 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:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2024-09-12 17:56:11,060 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 24 [2024-09-12 17:56:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:11,060 INFO L474 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2024-09-12 17:56:11,060 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:11,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2024-09-12 17:56:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 17:56:11,061 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:11,061 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] [2024-09-12 17:56:11,061 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 17:56:11,061 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:11,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1611119337, now seen corresponding path program 1 times [2024-09-12 17:56:11,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:11,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509063621] [2024-09-12 17:56:11,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:11,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:11,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509063621] [2024-09-12 17:56:11,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509063621] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667292215] [2024-09-12 17:56:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:11,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:11,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:11,104 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:11,106 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:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:11,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 17:56:11,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:11,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:11,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667292215] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:11,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-09-12 17:56:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205451915] [2024-09-12 17:56:11,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:11,266 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:56:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:56:11,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:56:11,267 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:11,708 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2024-09-12 17:56:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:11,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 27 [2024-09-12 17:56:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:11,710 INFO L225 Difference]: With dead ends: 306 [2024-09-12 17:56:11,710 INFO L226 Difference]: Without dead ends: 301 [2024-09-12 17:56:11,710 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:56:11,711 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 441 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:11,711 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 16 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 17:56:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-09-12 17:56:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 260. [2024-09-12 17:56:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 256 states have internal predecessors, (310), 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:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 313 transitions. [2024-09-12 17:56:11,779 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 313 transitions. Word has length 27 [2024-09-12 17:56:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:11,779 INFO L474 AbstractCegarLoop]: Abstraction has 260 states and 313 transitions. [2024-09-12 17:56:11,779 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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:11,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 313 transitions. [2024-09-12 17:56:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 17:56:11,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:11,781 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:11,799 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 17:56:11,982 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:11,982 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr24ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:11,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:11,983 INFO L85 PathProgramCache]: Analyzing trace with hash 307586987, now seen corresponding path program 1 times [2024-09-12 17:56:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757796030] [2024-09-12 17:56:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:11,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:12,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:12,047 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:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757796030] [2024-09-12 17:56:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757796030] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:12,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:12,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211102091] [2024-09-12 17:56:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:12,048 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:12,049 INFO L87 Difference]: Start difference. First operand 260 states and 313 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:12,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:12,227 INFO L93 Difference]: Finished difference Result 318 states and 373 transitions. [2024-09-12 17:56:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:12,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-12 17:56:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:12,229 INFO L225 Difference]: With dead ends: 318 [2024-09-12 17:56:12,229 INFO L226 Difference]: Without dead ends: 316 [2024-09-12 17:56:12,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:12,230 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:12,230 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 10 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-09-12 17:56:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 258. [2024-09-12 17:56:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 244 states have (on average 1.25) internal successors, (305), 254 states have internal predecessors, (305), 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:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2024-09-12 17:56:12,273 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 29 [2024-09-12 17:56:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:12,275 INFO L474 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2024-09-12 17:56:12,275 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:12,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2024-09-12 17:56:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 17:56:12,276 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:12,276 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] [2024-09-12 17:56:12,276 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 17:56:12,276 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr25ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:12,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 945265172, now seen corresponding path program 1 times [2024-09-12 17:56:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:12,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118841366] [2024-09-12 17:56:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:12,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:12,347 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:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:12,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118841366] [2024-09-12 17:56:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118841366] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:12,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:12,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72377391] [2024-09-12 17:56:12,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:12,348 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:12,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:12,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:12,349 INFO L87 Difference]: Start difference. First operand 258 states and 308 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:12,563 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2024-09-12 17:56:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2024-09-12 17:56:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:12,564 INFO L225 Difference]: With dead ends: 258 [2024-09-12 17:56:12,564 INFO L226 Difference]: Without dead ends: 256 [2024-09-12 17:56:12,565 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:12,565 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 157 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:12,565 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 13 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-09-12 17:56:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-09-12 17:56:12,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 243 states have (on average 1.2345679012345678) internal successors, (300), 252 states have internal predecessors, (300), 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:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 303 transitions. [2024-09-12 17:56:12,604 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 303 transitions. Word has length 30 [2024-09-12 17:56:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:12,604 INFO L474 AbstractCegarLoop]: Abstraction has 256 states and 303 transitions. [2024-09-12 17:56:12,604 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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:12,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 303 transitions. [2024-09-12 17:56:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 17:56:12,605 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:12,605 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] [2024-09-12 17:56:12,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-12 17:56:12,605 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr26ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:12,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -761547567, now seen corresponding path program 1 times [2024-09-12 17:56:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766208793] [2024-09-12 17:56:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:12,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:12,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:12,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:12,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766208793] [2024-09-12 17:56:12,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766208793] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:12,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:12,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:56:12,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425376854] [2024-09-12 17:56:12,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:12,692 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:12,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:12,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:12,693 INFO L87 Difference]: Start difference. First operand 256 states and 303 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:12,886 INFO L93 Difference]: Finished difference Result 266 states and 319 transitions. [2024-09-12 17:56:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 31 [2024-09-12 17:56:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:12,887 INFO L225 Difference]: With dead ends: 266 [2024-09-12 17:56:12,887 INFO L226 Difference]: Without dead ends: 264 [2024-09-12 17:56:12,887 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-09-12 17:56:12,888 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 144 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:12,888 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 13 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-09-12 17:56:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2024-09-12 17:56:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 242 states have (on average 1.21900826446281) internal successors, (295), 250 states have internal predecessors, (295), 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:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 298 transitions. [2024-09-12 17:56:12,930 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 298 transitions. Word has length 31 [2024-09-12 17:56:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:12,930 INFO L474 AbstractCegarLoop]: Abstraction has 254 states and 298 transitions. [2024-09-12 17:56:12,930 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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:12,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 298 transitions. [2024-09-12 17:56:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 17:56:12,931 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:12,931 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] [2024-09-12 17:56:12,931 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 17:56:12,931 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr27ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:12,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2133134918, now seen corresponding path program 1 times [2024-09-12 17:56:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338420512] [2024-09-12 17:56:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:13,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:13,027 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:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:13,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338420512] [2024-09-12 17:56:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338420512] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 17:56:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88302758] [2024-09-12 17:56:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:13,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:13,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:13,029 INFO L87 Difference]: Start difference. First operand 254 states and 298 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:13,259 INFO L93 Difference]: Finished difference Result 259 states and 302 transitions. [2024-09-12 17:56:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:13,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2024-09-12 17:56:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:13,261 INFO L225 Difference]: With dead ends: 259 [2024-09-12 17:56:13,261 INFO L226 Difference]: Without dead ends: 257 [2024-09-12 17:56:13,261 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:13,263 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 134 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:13,264 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 13 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-09-12 17:56:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 252. [2024-09-12 17:56:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 241 states have (on average 1.2033195020746887) internal successors, (290), 248 states have internal predecessors, (290), 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:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 293 transitions. [2024-09-12 17:56:13,324 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 293 transitions. Word has length 32 [2024-09-12 17:56:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:13,324 INFO L474 AbstractCegarLoop]: Abstraction has 252 states and 293 transitions. [2024-09-12 17:56:13,324 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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:13,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 293 transitions. [2024-09-12 17:56:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 17:56:13,325 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:13,325 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:13,326 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-12 17:56:13,327 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:13,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1702669865, now seen corresponding path program 1 times [2024-09-12 17:56:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225588984] [2024-09-12 17:56:13,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:13,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:13,389 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:13,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225588984] [2024-09-12 17:56:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225588984] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:13,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 17:56:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901631557] [2024-09-12 17:56:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:13,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:13,392 INFO L87 Difference]: Start difference. First operand 252 states and 293 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:13,599 INFO L93 Difference]: Finished difference Result 341 states and 395 transitions. [2024-09-12 17:56:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:13,601 INFO L225 Difference]: With dead ends: 341 [2024-09-12 17:56:13,601 INFO L226 Difference]: Without dead ends: 338 [2024-09-12 17:56:13,601 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:13,602 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:13,602 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 10 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-09-12 17:56:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 332. [2024-09-12 17:56:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 321 states have (on average 1.1775700934579438) internal successors, (378), 328 states have internal predecessors, (378), 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:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 381 transitions. [2024-09-12 17:56:13,658 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 381 transitions. Word has length 33 [2024-09-12 17:56:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:13,658 INFO L474 AbstractCegarLoop]: Abstraction has 332 states and 381 transitions. [2024-09-12 17:56:13,658 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 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:13,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 381 transitions. [2024-09-12 17:56:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 17:56:13,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:13,660 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] [2024-09-12 17:56:13,660 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-12 17:56:13,660 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr32ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:13,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash 580692795, now seen corresponding path program 1 times [2024-09-12 17:56:13,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122533464] [2024-09-12 17:56:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:13,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:13,787 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:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122533464] [2024-09-12 17:56:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122533464] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:13,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:13,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 17:56:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383412302] [2024-09-12 17:56:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:13,788 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 17:56:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:13,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 17:56:13,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:56:13,789 INFO L87 Difference]: Start difference. First operand 332 states and 381 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:14,021 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2024-09-12 17:56:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:56:14,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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 37 [2024-09-12 17:56:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:14,023 INFO L225 Difference]: With dead ends: 342 [2024-09-12 17:56:14,023 INFO L226 Difference]: Without dead ends: 340 [2024-09-12 17:56:14,024 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-09-12 17:56:14,024 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 128 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:14,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 19 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-09-12 17:56:14,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 330. [2024-09-12 17:56:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 320 states have (on average 1.16875) internal successors, (374), 326 states have internal predecessors, (374), 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:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 377 transitions. [2024-09-12 17:56:14,083 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 377 transitions. Word has length 37 [2024-09-12 17:56:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:14,084 INFO L474 AbstractCegarLoop]: Abstraction has 330 states and 377 transitions. [2024-09-12 17:56:14,084 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 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:14,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 377 transitions. [2024-09-12 17:56:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 17:56:14,085 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:14,085 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] [2024-09-12 17:56:14,085 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-12 17:56:14,085 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr33ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:14,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:14,086 INFO L85 PathProgramCache]: Analyzing trace with hash 821610660, now seen corresponding path program 1 times [2024-09-12 17:56:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274311753] [2024-09-12 17:56:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:14,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:14,170 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:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274311753] [2024-09-12 17:56:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274311753] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:14,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 17:56:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649912967] [2024-09-12 17:56:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:14,172 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:56:14,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:14,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:56:14,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:14,172 INFO L87 Difference]: Start difference. First operand 330 states and 377 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:14,490 INFO L93 Difference]: Finished difference Result 339 states and 384 transitions. [2024-09-12 17:56:14,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:56:14,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 38 [2024-09-12 17:56:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:14,493 INFO L225 Difference]: With dead ends: 339 [2024-09-12 17:56:14,493 INFO L226 Difference]: Without dead ends: 337 [2024-09-12 17:56:14,493 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:14,494 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 161 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:14,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 13 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-09-12 17:56:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 328. [2024-09-12 17:56:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 319 states have (on average 1.1598746081504703) internal successors, (370), 324 states have internal predecessors, (370), 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:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 373 transitions. [2024-09-12 17:56:14,546 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 373 transitions. Word has length 38 [2024-09-12 17:56:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:14,547 INFO L474 AbstractCegarLoop]: Abstraction has 328 states and 373 transitions. [2024-09-12 17:56:14,547 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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:14,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 373 transitions. [2024-09-12 17:56:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-12 17:56:14,547 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:14,548 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] [2024-09-12 17:56:14,548 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-09-12 17:56:14,548 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:14,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash -299870143, now seen corresponding path program 1 times [2024-09-12 17:56:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486769547] [2024-09-12 17:56:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:14,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:14,615 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:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486769547] [2024-09-12 17:56:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486769547] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493298135] [2024-09-12 17:56:14,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:14,616 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:56:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:14,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:56:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:56:14,617 INFO L87 Difference]: Start difference. First operand 328 states and 373 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:14,889 INFO L93 Difference]: Finished difference Result 427 states and 484 transitions. [2024-09-12 17:56:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:56:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2024-09-12 17:56:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:14,892 INFO L225 Difference]: With dead ends: 427 [2024-09-12 17:56:14,892 INFO L226 Difference]: Without dead ends: 423 [2024-09-12 17:56:14,892 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-09-12 17:56:14,893 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 267 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:14,893 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 7 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:56:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-09-12 17:56:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2024-09-12 17:56:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 403 states have (on average 1.15136476426799) internal successors, (464), 408 states have internal predecessors, (464), 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:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 467 transitions. [2024-09-12 17:56:14,980 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 467 transitions. Word has length 39 [2024-09-12 17:56:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:14,980 INFO L474 AbstractCegarLoop]: Abstraction has 412 states and 467 transitions. [2024-09-12 17:56:14,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:14,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 467 transitions. [2024-09-12 17:56:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-12 17:56:14,981 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:14,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:14,982 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-12 17:56:14,982 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:14,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:14,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1658613985, now seen corresponding path program 1 times [2024-09-12 17:56:14,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:14,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820150926] [2024-09-12 17:56:14,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:14,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:15,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 17:56:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820150926] [2024-09-12 17:56:15,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820150926] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178356622] [2024-09-12 17:56:15,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:15,059 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:15,064 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:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:15,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:56:15,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:15,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:15,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178356622] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:15,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-09-12 17:56:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192353270] [2024-09-12 17:56:15,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:15,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 17:56:15,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:15,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 17:56:15,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-09-12 17:56:15,301 INFO L87 Difference]: Start difference. First operand 412 states and 467 transitions. Second operand has 14 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:15,797 INFO L93 Difference]: Finished difference Result 520 states and 591 transitions. [2024-09-12 17:56:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 17:56:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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 51 [2024-09-12 17:56:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:15,801 INFO L225 Difference]: With dead ends: 520 [2024-09-12 17:56:15,801 INFO L226 Difference]: Without dead ends: 516 [2024-09-12 17:56:15,801 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=353, Unknown=0, NotChecked=0, Total=552 [2024-09-12 17:56:15,802 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 795 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:15,802 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 13 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 17:56:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-09-12 17:56:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 175. [2024-09-12 17:56:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.111764705882353) internal successors, (189), 171 states have internal predecessors, (189), 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:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 192 transitions. [2024-09-12 17:56:15,852 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 192 transitions. Word has length 51 [2024-09-12 17:56:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:15,852 INFO L474 AbstractCegarLoop]: Abstraction has 175 states and 192 transitions. [2024-09-12 17:56:15,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 10.615384615384615) internal successors, (138), 13 states have internal predecessors, (138), 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:15,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2024-09-12 17:56:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-12 17:56:15,853 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:15,853 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:15,865 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 17:56:16,053 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-12 17:56:16,054 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:16,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:16,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1471890807, now seen corresponding path program 2 times [2024-09-12 17:56:16,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667983777] [2024-09-12 17:56:16,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:16,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-09-12 17:56:16,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:16,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667983777] [2024-09-12 17:56:16,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667983777] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:16,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501625855] [2024-09-12 17:56:16,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:56:16,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:16,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:16,116 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:16,117 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:16,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:56:16,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:56:16,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 17:56:16,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-09-12 17:56:16,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-09-12 17:56:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501625855] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:16,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:16,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-09-12 17:56:16,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289483645] [2024-09-12 17:56:16,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:16,299 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:16,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:16,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:16,300 INFO L87 Difference]: Start difference. First operand 175 states and 192 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:16,419 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2024-09-12 17:56:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-09-12 17:56:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:16,421 INFO L225 Difference]: With dead ends: 179 [2024-09-12 17:56:16,421 INFO L226 Difference]: Without dead ends: 178 [2024-09-12 17:56:16,421 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 1 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:16,421 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:16,421 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 10 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-09-12 17:56:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 139. [2024-09-12 17:56:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 135 states have (on average 1.1185185185185185) internal successors, (151), 135 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:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2024-09-12 17:56:16,467 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 69 [2024-09-12 17:56:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:16,467 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2024-09-12 17:56:16,467 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:56:16,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2024-09-12 17:56:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-12 17:56:16,468 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:16,468 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:16,484 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 17:56:16,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-12 17:56:16,669 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:16,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:16,669 INFO L85 PathProgramCache]: Analyzing trace with hash 680111641, now seen corresponding path program 1 times [2024-09-12 17:56:16,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:16,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419456952] [2024-09-12 17:56:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:16,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-12 17:56:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419456952] [2024-09-12 17:56:16,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419456952] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:56:16,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:56:16,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:56:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080854823] [2024-09-12 17:56:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:56:16,742 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:56:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:56:16,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:56:16,743 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:16,922 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2024-09-12 17:56:16,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:56:16,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 77 [2024-09-12 17:56:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:16,924 INFO L225 Difference]: With dead ends: 262 [2024-09-12 17:56:16,924 INFO L226 Difference]: Without dead ends: 139 [2024-09-12 17:56:16,925 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:56:16,925 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 60 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:16,925 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 10 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:56:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-09-12 17:56:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-09-12 17:56:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.0681818181818181) internal successors, (141), 132 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:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2024-09-12 17:56:16,966 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 77 [2024-09-12 17:56:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:16,966 INFO L474 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2024-09-12 17:56:16,966 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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:16,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2024-09-12 17:56:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-09-12 17:56:16,967 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:16,967 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:56:16,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-09-12 17:56:16,971 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:16,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 53455456, now seen corresponding path program 1 times [2024-09-12 17:56:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:16,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170636162] [2024-09-12 17:56:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:16,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:17,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170636162] [2024-09-12 17:56:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170636162] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592816139] [2024-09-12 17:56:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:17,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:17,112 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:17,114 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:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:17,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 17:56:17,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:17,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:17,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592816139] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:17,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:17,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-09-12 17:56:17,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960022555] [2024-09-12 17:56:17,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:17,455 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 17:56:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:17,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 17:56:17,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-09-12 17:56:17,456 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand has 14 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 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:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:18,043 INFO L93 Difference]: Finished difference Result 411 states and 437 transitions. [2024-09-12 17:56:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 17:56:18,043 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 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 84 [2024-09-12 17:56:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:18,045 INFO L225 Difference]: With dead ends: 411 [2024-09-12 17:56:18,045 INFO L226 Difference]: Without dead ends: 410 [2024-09-12 17:56:18,045 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2024-09-12 17:56:18,046 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 718 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:18,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 16 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 17:56:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-09-12 17:56:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 376. [2024-09-12 17:56:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 372 states have (on average 1.0564516129032258) internal successors, (393), 372 states have internal predecessors, (393), 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:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 396 transitions. [2024-09-12 17:56:18,148 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 396 transitions. Word has length 84 [2024-09-12 17:56:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:18,148 INFO L474 AbstractCegarLoop]: Abstraction has 376 states and 396 transitions. [2024-09-12 17:56:18,148 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.846153846153847) internal successors, (180), 13 states have internal predecessors, (180), 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:18,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 396 transitions. [2024-09-12 17:56:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-09-12 17:56:18,150 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:56:18,150 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-09-12 17:56:18,167 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:18,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:18,351 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2024-09-12 17:56:18,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1959756343, now seen corresponding path program 2 times [2024-09-12 17:56:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:56:18,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139908843] [2024-09-12 17:56:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:56:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:56:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:18,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:56:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:56:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:56:18,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:56:18,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139908843] [2024-09-12 17:56:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139908843] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:56:18,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730386390] [2024-09-12 17:56:18,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:56:18,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:56:18,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:56:18,723 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:18,724 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:18,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-12 17:56:18,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:56:18,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 17:56:18,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:56:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 17:56:19,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:56:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-09-12 17:56:19,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730386390] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:56:19,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:56:19,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2024-09-12 17:56:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145301511] [2024-09-12 17:56:19,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:56:19,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 17:56:19,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:56:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 17:56:19,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2024-09-12 17:56:19,175 INFO L87 Difference]: Start difference. First operand 376 states and 396 transitions. Second operand has 17 states, 16 states have (on average 14.875) internal successors, (238), 16 states have internal predecessors, (238), 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:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:56:20,090 INFO L93 Difference]: Finished difference Result 496 states and 523 transitions. [2024-09-12 17:56:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 17:56:20,091 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 14.875) internal successors, (238), 16 states have internal predecessors, (238), 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 174 [2024-09-12 17:56:20,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:56:20,092 INFO L225 Difference]: With dead ends: 496 [2024-09-12 17:56:20,092 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 17:56:20,093 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 345 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2024-09-12 17:56:20,094 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 979 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 17:56:20,094 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 16 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 17:56:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 17:56:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 17:56:20,094 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:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 17:56:20,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2024-09-12 17:56:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:56:20,095 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 17:56:20,095 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 14.875) internal successors, (238), 16 states have internal predecessors, (238), 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:20,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:56:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 17:56:20,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 17:56:20,098 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 36 remaining) [2024-09-12 17:56:20,098 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 36 remaining) [2024-09-12 17:56:20,098 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 36 remaining) [2024-09-12 17:56:20,099 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 36 remaining) [2024-09-12 17:56:20,100 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 36 remaining) [2024-09-12 17:56:20,101 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 36 remaining) [2024-09-12 17:56:20,102 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 36 remaining) [2024-09-12 17:56:20,102 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 36 remaining) [2024-09-12 17:56:20,102 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 36 remaining) [2024-09-12 17:56:20,102 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 36 remaining) [2024-09-12 17:56:20,114 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:20,306 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-12 17:56:20,309 INFO L408 BasicCegarLoop]: Path program histogram: [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] [2024-09-12 17:56:20,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.