./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbdd132d1a656eb04120c9309772a096548e218c86a32fc06dd93d5ae981c163 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:00:56,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:56,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:56,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:56,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:56,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:56,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:56,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:56,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:56,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:56,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:56,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:56,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:56,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:56,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:56,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:56,997 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:56,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:56,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:57,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:57,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:57,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:57,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:57,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:57,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:57,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:57,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:57,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:57,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:57,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:57,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:57,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:57,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:57,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:57,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:57,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:57,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:57,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:57,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:57,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:57,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:57,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 21:00:57,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:57,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:57,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:57,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:57,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:00:57,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:00:57,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:57,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:57,064 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:57,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:57,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:00:57,066 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:00:57,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:57,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:00:57,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:57,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:00:57,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:00:57,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:00:57,068 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 21:00:57,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:00:57,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:57,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:57,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:00:57,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:57,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:57,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:00:57,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:57,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:57,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:00:57,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:00:57,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:57,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:00:57,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:00:57,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! overflow) ) 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 -> dbdd132d1a656eb04120c9309772a096548e218c86a32fc06dd93d5ae981c163 [2022-11-02 21:00:57,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:57,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:57,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:57,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:57,455 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:57,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2022-11-02 21:00:57,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/data/9cef489ed/a658492ce1c14bfb8da43eb8f1223dc2/FLAGfacf4dc69 [2022-11-02 21:00:58,108 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:58,108 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2022-11-02 21:00:58,135 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/data/9cef489ed/a658492ce1c14bfb8da43eb8f1223dc2/FLAGfacf4dc69 [2022-11-02 21:00:58,367 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/data/9cef489ed/a658492ce1c14bfb8da43eb8f1223dc2 [2022-11-02 21:00:58,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:58,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:58,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:58,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:58,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:58,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:58" (1/1) ... [2022-11-02 21:00:58,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104db9f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:58, skipping insertion in model container [2022-11-02 21:00:58,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:58" (1/1) ... [2022-11-02 21:00:58,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:58,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:58,713 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 21:00:59,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[75002,75015] [2022-11-02 21:00:59,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:59,311 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:59,323 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-02 21:00:59,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/sv-benchmarks/c/ldv-races/race-2_2-container_of.i[75002,75015] [2022-11-02 21:00:59,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:59,500 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59 WrapperNode [2022-11-02 21:00:59,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:59,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:59,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:59,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:59,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,602 INFO L138 Inliner]: procedures = 468, calls = 48, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 115 [2022-11-02 21:00:59,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:59,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:59,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:59,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:59,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:59,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:59,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:59,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:59,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (1/1) ... [2022-11-02 21:00:59,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:59,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:59,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:00:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:00:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:00:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:00:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:00:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:00:59,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:59,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-11-02 21:00:59,755 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-11-02 21:00:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:00:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:00:59,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:59,758 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 21:01:00,083 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:01:00,086 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:01:00,356 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:01:00,390 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:01:00,392 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:01:00,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:00 BoogieIcfgContainer [2022-11-02 21:01:00,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:01:00,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:01:00,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:01:00,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:01:00,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:00:58" (1/3) ... [2022-11-02 21:01:00,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d58df63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:01:00, skipping insertion in model container [2022-11-02 21:01:00,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:59" (2/3) ... [2022-11-02 21:01:00,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d58df63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:01:00, skipping insertion in model container [2022-11-02 21:01:00,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:00" (3/3) ... [2022-11-02 21:01:00,407 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2022-11-02 21:01:00,415 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:01:00,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:01:00,455 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:01:00,456 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:01:00,547 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 21:01:00,593 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 21:01:00,612 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 163 transitions, 342 flow [2022-11-02 21:01:00,617 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 163 transitions, 342 flow [2022-11-02 21:01:00,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 163 transitions, 342 flow [2022-11-02 21:01:00,740 INFO L130 PetriNetUnfolder]: 8/206 cut-off events. [2022-11-02 21:01:00,740 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 21:01:00,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 206 events. 8/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 337 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 113. Up to 4 conditions per place. [2022-11-02 21:01:00,750 INFO L118 LiptonReduction]: Number of co-enabled transitions 2856 [2022-11-02 21:02:00,637 INFO L133 LiptonReduction]: Checked pairs total: 5972 [2022-11-02 21:02:00,637 INFO L135 LiptonReduction]: Total number of compositions: 171 [2022-11-02 21:02:00,645 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 30 transitions, 76 flow [2022-11-02 21:02:00,682 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 274 states, 254 states have (on average 2.763779527559055) internal successors, (702), 273 states have internal predecessors, (702), 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) [2022-11-02 21:02:00,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:02:00,709 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@28da701, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:02:00,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-02 21:02:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 274 states, 254 states have (on average 2.763779527559055) internal successors, (702), 273 states have internal predecessors, (702), 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) [2022-11-02 21:02:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 21:02:00,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:00,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 21:02:00,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:00,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash 17654385, now seen corresponding path program 1 times [2022-11-02 21:02:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259219516] [2022-11-02 21:02:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:00,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259219516] [2022-11-02 21:02:01,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259219516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:01,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:01,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683452348] [2022-11-02 21:02:01,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:01,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:02:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:01,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:02:01,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:02:01,870 INFO L87 Difference]: Start difference. First operand has 274 states, 254 states have (on average 2.763779527559055) internal successors, (702), 273 states have internal predecessors, (702), 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) Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-11-02 21:02:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:02,132 INFO L93 Difference]: Finished difference Result 272 states and 663 transitions. [2022-11-02 21:02:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:02:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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) Word has length 4 [2022-11-02 21:02:02,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:02,152 INFO L225 Difference]: With dead ends: 272 [2022-11-02 21:02:02,152 INFO L226 Difference]: Without dead ends: 248 [2022-11-02 21:02:02,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:02,158 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:02,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-11-02 21:02:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-11-02 21:02:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 232 states have (on average 2.5732758620689653) internal successors, (597), 247 states have internal predecessors, (597), 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) [2022-11-02 21:02:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 597 transitions. [2022-11-02 21:02:02,245 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 597 transitions. Word has length 4 [2022-11-02 21:02:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:02,246 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 597 transitions. [2022-11-02 21:02:02,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 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) [2022-11-02 21:02:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 597 transitions. [2022-11-02 21:02:02,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 21:02:02,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:02,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 21:02:02,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:02:02,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 547292237, now seen corresponding path program 1 times [2022-11-02 21:02:02,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:02,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148598199] [2022-11-02 21:02:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148598199] [2022-11-02 21:02:02,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148598199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:02,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:02,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:02:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139862418] [2022-11-02 21:02:02,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:02,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:02,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:02,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:02,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:02,890 INFO L87 Difference]: Start difference. First operand 248 states and 597 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) [2022-11-02 21:02:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:03,114 INFO L93 Difference]: Finished difference Result 256 states and 619 transitions. [2022-11-02 21:02:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:02:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) Word has length 5 [2022-11-02 21:02:03,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:03,118 INFO L225 Difference]: With dead ends: 256 [2022-11-02 21:02:03,118 INFO L226 Difference]: Without dead ends: 256 [2022-11-02 21:02:03,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:03,120 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:03,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:03,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-02 21:02:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2022-11-02 21:02:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 236 states have (on average 2.5762711864406778) internal successors, (608), 251 states have internal predecessors, (608), 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) [2022-11-02 21:02:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 608 transitions. [2022-11-02 21:02:03,135 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 608 transitions. Word has length 5 [2022-11-02 21:02:03,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:03,135 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 608 transitions. [2022-11-02 21:02:03,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) [2022-11-02 21:02:03,136 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 608 transitions. [2022-11-02 21:02:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 21:02:03,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:03,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 21:02:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:02:03,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 547288517, now seen corresponding path program 2 times [2022-11-02 21:02:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:03,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82657911] [2022-11-02 21:02:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:03,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:03,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82657911] [2022-11-02 21:02:03,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82657911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:03,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:03,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:02:03,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628860506] [2022-11-02 21:02:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:03,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:03,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:03,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:03,720 INFO L87 Difference]: Start difference. First operand 252 states and 608 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) [2022-11-02 21:02:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:03,954 INFO L93 Difference]: Finished difference Result 244 states and 586 transitions. [2022-11-02 21:02:03,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:02:03,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) Word has length 5 [2022-11-02 21:02:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:03,956 INFO L225 Difference]: With dead ends: 244 [2022-11-02 21:02:03,956 INFO L226 Difference]: Without dead ends: 244 [2022-11-02 21:02:03,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:03,958 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:03,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-02 21:02:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2022-11-02 21:02:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 224 states have (on average 2.5669642857142856) internal successors, (575), 239 states have internal predecessors, (575), 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) [2022-11-02 21:02:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 575 transitions. [2022-11-02 21:02:03,982 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 575 transitions. Word has length 5 [2022-11-02 21:02:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:03,983 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 575 transitions. [2022-11-02 21:02:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 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) [2022-11-02 21:02:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 575 transitions. [2022-11-02 21:02:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 21:02:03,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:03,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 21:02:03,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:02:03,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -213934161, now seen corresponding path program 1 times [2022-11-02 21:02:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:03,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711136138] [2022-11-02 21:02:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:04,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711136138] [2022-11-02 21:02:04,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711136138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:04,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:04,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:02:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422051824] [2022-11-02 21:02:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:04,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:04,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:04,599 INFO L87 Difference]: Start difference. First operand 240 states and 575 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2022-11-02 21:02:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:04,860 INFO L93 Difference]: Finished difference Result 234 states and 557 transitions. [2022-11-02 21:02:04,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:02:04,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) Word has length 6 [2022-11-02 21:02:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:04,862 INFO L225 Difference]: With dead ends: 234 [2022-11-02 21:02:04,862 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 21:02:04,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:04,864 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:04,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 21:02:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-11-02 21:02:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 218 states have (on average 2.555045871559633) internal successors, (557), 233 states have internal predecessors, (557), 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) [2022-11-02 21:02:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 557 transitions. [2022-11-02 21:02:04,873 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 557 transitions. Word has length 6 [2022-11-02 21:02:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:04,874 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 557 transitions. [2022-11-02 21:02:04,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2022-11-02 21:02:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 557 transitions. [2022-11-02 21:02:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:02:04,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:04,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:04,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:02:04,875 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:04,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1957975959, now seen corresponding path program 1 times [2022-11-02 21:02:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:04,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96029443] [2022-11-02 21:02:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:05,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:05,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96029443] [2022-11-02 21:02:05,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96029443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:05,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:05,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:05,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861663188] [2022-11-02 21:02:05,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:05,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:02:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:05,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:02:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:05,865 INFO L87 Difference]: Start difference. First operand 234 states and 557 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:06,216 INFO L93 Difference]: Finished difference Result 255 states and 614 transitions. [2022-11-02 21:02:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) Word has length 7 [2022-11-02 21:02:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:06,219 INFO L225 Difference]: With dead ends: 255 [2022-11-02 21:02:06,219 INFO L226 Difference]: Without dead ends: 255 [2022-11-02 21:02:06,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:06,220 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 36 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:06,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:06,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-02 21:02:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 246. [2022-11-02 21:02:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 230 states have (on average 2.5652173913043477) internal successors, (590), 245 states have internal predecessors, (590), 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) [2022-11-02 21:02:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 590 transitions. [2022-11-02 21:02:06,231 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 590 transitions. Word has length 7 [2022-11-02 21:02:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:06,232 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 590 transitions. [2022-11-02 21:02:06,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:06,233 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 590 transitions. [2022-11-02 21:02:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:02:06,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:06,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:06,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:02:06,235 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:06,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1957975982, now seen corresponding path program 1 times [2022-11-02 21:02:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:06,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920376928] [2022-11-02 21:02:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:07,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:07,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920376928] [2022-11-02 21:02:07,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920376928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:07,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:07,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:07,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733882148] [2022-11-02 21:02:07,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:02:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:02:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:07,062 INFO L87 Difference]: Start difference. First operand 246 states and 590 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:07,617 INFO L93 Difference]: Finished difference Result 251 states and 597 transitions. [2022-11-02 21:02:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:02:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) Word has length 7 [2022-11-02 21:02:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:07,619 INFO L225 Difference]: With dead ends: 251 [2022-11-02 21:02:07,619 INFO L226 Difference]: Without dead ends: 251 [2022-11-02 21:02:07,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:02:07,620 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:07,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-02 21:02:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 237. [2022-11-02 21:02:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 225 states have (on average 2.488888888888889) internal successors, (560), 236 states have internal predecessors, (560), 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) [2022-11-02 21:02:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 560 transitions. [2022-11-02 21:02:07,632 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 560 transitions. Word has length 7 [2022-11-02 21:02:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:07,633 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 560 transitions. [2022-11-02 21:02:07,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 560 transitions. [2022-11-02 21:02:07,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:02:07,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:07,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:07,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:02:07,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1957978749, now seen corresponding path program 2 times [2022-11-02 21:02:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:07,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320642656] [2022-11-02 21:02:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:07,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:08,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:08,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320642656] [2022-11-02 21:02:08,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320642656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:08,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:08,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438513748] [2022-11-02 21:02:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:08,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:02:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:02:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:08,392 INFO L87 Difference]: Start difference. First operand 237 states and 560 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:08,745 INFO L93 Difference]: Finished difference Result 225 states and 524 transitions. [2022-11-02 21:02:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:02:08,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) Word has length 7 [2022-11-02 21:02:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:08,747 INFO L225 Difference]: With dead ends: 225 [2022-11-02 21:02:08,748 INFO L226 Difference]: Without dead ends: 225 [2022-11-02 21:02:08,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:08,748 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:08,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-02 21:02:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2022-11-02 21:02:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 207 states have (on average 2.4589371980676327) internal successors, (509), 218 states have internal predecessors, (509), 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) [2022-11-02 21:02:08,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 509 transitions. [2022-11-02 21:02:08,756 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 509 transitions. Word has length 7 [2022-11-02 21:02:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:08,756 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 509 transitions. [2022-11-02 21:02:08,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 509 transitions. [2022-11-02 21:02:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 21:02:08,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:08,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:08,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:02:08,758 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:08,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1961781542, now seen corresponding path program 2 times [2022-11-02 21:02:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:08,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160044384] [2022-11-02 21:02:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:09,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:09,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160044384] [2022-11-02 21:02:09,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160044384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:09,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:09,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018587365] [2022-11-02 21:02:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:09,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:02:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:02:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:02:09,445 INFO L87 Difference]: Start difference. First operand 219 states and 509 transitions. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:09,872 INFO L93 Difference]: Finished difference Result 213 states and 488 transitions. [2022-11-02 21:02:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:09,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) Word has length 7 [2022-11-02 21:02:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:09,874 INFO L225 Difference]: With dead ends: 213 [2022-11-02 21:02:09,875 INFO L226 Difference]: Without dead ends: 213 [2022-11-02 21:02:09,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:09,876 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:09,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-02 21:02:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2022-11-02 21:02:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 2.413978494623656) internal successors, (449), 197 states have internal predecessors, (449), 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) [2022-11-02 21:02:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 449 transitions. [2022-11-02 21:02:09,885 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 449 transitions. Word has length 7 [2022-11-02 21:02:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:09,886 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 449 transitions. [2022-11-02 21:02:09,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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) [2022-11-02 21:02:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 449 transitions. [2022-11-02 21:02:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 21:02:09,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:09,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:09,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:02:09,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:09,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash 568416325, now seen corresponding path program 1 times [2022-11-02 21:02:09,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:09,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090012810] [2022-11-02 21:02:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:09,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:09,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090012810] [2022-11-02 21:02:09,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090012810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:09,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:09,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:02:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094351446] [2022-11-02 21:02:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:09,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:09,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:09,975 INFO L87 Difference]: Start difference. First operand 198 states and 449 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-11-02 21:02:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:10,069 INFO L93 Difference]: Finished difference Result 70 states and 129 transitions. [2022-11-02 21:02:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:10,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2022-11-02 21:02:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:10,071 INFO L225 Difference]: With dead ends: 70 [2022-11-02 21:02:10,071 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 21:02:10,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:02:10,072 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:10,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:02:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 21:02:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 21:02:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 69 states have internal predecessors, (129), 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) [2022-11-02 21:02:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2022-11-02 21:02:10,075 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 8 [2022-11-02 21:02:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:10,075 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2022-11-02 21:02:10,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-11-02 21:02:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2022-11-02 21:02:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:10,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:10,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:10,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:02:10,077 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:10,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash 414653242, now seen corresponding path program 1 times [2022-11-02 21:02:10,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:10,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568313307] [2022-11-02 21:02:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:10,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:10,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568313307] [2022-11-02 21:02:10,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568313307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:10,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:10,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856596581] [2022-11-02 21:02:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:10,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:10,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:10,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:10,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:10,803 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:11,316 INFO L93 Difference]: Finished difference Result 116 states and 212 transitions. [2022-11-02 21:02:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:02:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:11,317 INFO L225 Difference]: With dead ends: 116 [2022-11-02 21:02:11,317 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 21:02:11,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:02:11,319 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:11,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 21:02:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84. [2022-11-02 21:02:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 2.0125) internal successors, (161), 83 states have internal predecessors, (161), 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) [2022-11-02 21:02:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 161 transitions. [2022-11-02 21:02:11,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 161 transitions. Word has length 9 [2022-11-02 21:02:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:11,334 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 161 transitions. [2022-11-02 21:02:11,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 161 transitions. [2022-11-02 21:02:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:11,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:11,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:11,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:02:11,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 414653243, now seen corresponding path program 1 times [2022-11-02 21:02:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963163733] [2022-11-02 21:02:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:12,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:12,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963163733] [2022-11-02 21:02:12,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963163733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:12,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:12,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:12,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564432372] [2022-11-02 21:02:12,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:12,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:12,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:12,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:12,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:12,438 INFO L87 Difference]: Start difference. First operand 84 states and 161 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:13,260 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2022-11-02 21:02:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:02:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:13,261 INFO L225 Difference]: With dead ends: 113 [2022-11-02 21:02:13,262 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 21:02:13,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:02:13,263 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:13,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 21:02:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2022-11-02 21:02:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.9777777777777779) internal successors, (178), 93 states have internal predecessors, (178), 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) [2022-11-02 21:02:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 178 transitions. [2022-11-02 21:02:13,285 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 178 transitions. Word has length 9 [2022-11-02 21:02:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:13,285 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 178 transitions. [2022-11-02 21:02:13,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 178 transitions. [2022-11-02 21:02:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:13,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:13,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:13,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:02:13,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 414676492, now seen corresponding path program 2 times [2022-11-02 21:02:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:13,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909375691] [2022-11-02 21:02:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909375691] [2022-11-02 21:02:13,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909375691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:13,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:13,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:13,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605959646] [2022-11-02 21:02:13,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:13,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:13,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:13,871 INFO L87 Difference]: Start difference. First operand 94 states and 178 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:14,277 INFO L93 Difference]: Finished difference Result 145 states and 246 transitions. [2022-11-02 21:02:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:02:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:14,278 INFO L225 Difference]: With dead ends: 145 [2022-11-02 21:02:14,279 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 21:02:14,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:02:14,280 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:14,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 21:02:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2022-11-02 21:02:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.9705882352941178) internal successors, (201), 105 states have internal predecessors, (201), 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) [2022-11-02 21:02:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 201 transitions. [2022-11-02 21:02:14,285 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 201 transitions. Word has length 9 [2022-11-02 21:02:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:14,286 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 201 transitions. [2022-11-02 21:02:14,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 201 transitions. [2022-11-02 21:02:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:14,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:14,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:14,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:02:14,288 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:14,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:14,288 INFO L85 PathProgramCache]: Analyzing trace with hash 419185620, now seen corresponding path program 1 times [2022-11-02 21:02:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:14,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431649294] [2022-11-02 21:02:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:15,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431649294] [2022-11-02 21:02:15,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431649294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:15,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:15,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:15,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524126418] [2022-11-02 21:02:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:15,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:15,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:15,296 INFO L87 Difference]: Start difference. First operand 106 states and 201 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:16,007 INFO L93 Difference]: Finished difference Result 126 states and 241 transitions. [2022-11-02 21:02:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:02:16,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:16,008 INFO L225 Difference]: With dead ends: 126 [2022-11-02 21:02:16,009 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 21:02:16,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:16,009 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:16,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 21:02:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 100. [2022-11-02 21:02:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 99 states have internal predecessors, (188), 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) [2022-11-02 21:02:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 188 transitions. [2022-11-02 21:02:16,014 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 188 transitions. Word has length 9 [2022-11-02 21:02:16,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:16,015 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 188 transitions. [2022-11-02 21:02:16,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 188 transitions. [2022-11-02 21:02:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:16,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:16,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:16,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:02:16,016 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash 421855162, now seen corresponding path program 3 times [2022-11-02 21:02:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:16,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983358641] [2022-11-02 21:02:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:16,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:16,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:16,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983358641] [2022-11-02 21:02:16,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983358641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:16,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:16,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657663729] [2022-11-02 21:02:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:16,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:16,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:16,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:16,537 INFO L87 Difference]: Start difference. First operand 100 states and 188 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:16,908 INFO L93 Difference]: Finished difference Result 117 states and 204 transitions. [2022-11-02 21:02:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:02:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:16,910 INFO L225 Difference]: With dead ends: 117 [2022-11-02 21:02:16,910 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 21:02:16,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:16,911 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:16,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:16,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 21:02:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-02 21:02:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.9473684210526316) internal successors, (185), 98 states have internal predecessors, (185), 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) [2022-11-02 21:02:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 185 transitions. [2022-11-02 21:02:16,915 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 185 transitions. Word has length 9 [2022-11-02 21:02:16,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:16,916 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 185 transitions. [2022-11-02 21:02:16,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 185 transitions. [2022-11-02 21:02:16,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:16,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:16,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:16,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:02:16,918 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 421866810, now seen corresponding path program 2 times [2022-11-02 21:02:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115333982] [2022-11-02 21:02:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:16,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:17,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:17,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115333982] [2022-11-02 21:02:17,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115333982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:17,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:17,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104408688] [2022-11-02 21:02:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:17,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:17,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:17,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:17,922 INFO L87 Difference]: Start difference. First operand 99 states and 185 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:18,705 INFO L93 Difference]: Finished difference Result 125 states and 235 transitions. [2022-11-02 21:02:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:02:18,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:18,706 INFO L225 Difference]: With dead ends: 125 [2022-11-02 21:02:18,706 INFO L226 Difference]: Without dead ends: 119 [2022-11-02 21:02:18,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:02:18,708 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:18,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-02 21:02:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2022-11-02 21:02:18,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.923913043478261) internal successors, (177), 95 states have internal predecessors, (177), 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) [2022-11-02 21:02:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2022-11-02 21:02:18,712 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 9 [2022-11-02 21:02:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:18,713 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2022-11-02 21:02:18,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2022-11-02 21:02:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:18,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:18,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:18,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:02:18,715 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 417784110, now seen corresponding path program 3 times [2022-11-02 21:02:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:18,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485014088] [2022-11-02 21:02:18,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:19,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:19,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485014088] [2022-11-02 21:02:19,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485014088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:19,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:19,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173652888] [2022-11-02 21:02:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:19,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:19,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:19,664 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:20,653 INFO L93 Difference]: Finished difference Result 116 states and 217 transitions. [2022-11-02 21:02:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:02:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:20,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:20,654 INFO L225 Difference]: With dead ends: 116 [2022-11-02 21:02:20,654 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 21:02:20,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:02:20,656 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:20,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 21:02:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2022-11-02 21:02:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.924731182795699) internal successors, (179), 96 states have internal predecessors, (179), 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) [2022-11-02 21:02:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 179 transitions. [2022-11-02 21:02:20,661 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 179 transitions. Word has length 9 [2022-11-02 21:02:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:20,662 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 179 transitions. [2022-11-02 21:02:20,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 179 transitions. [2022-11-02 21:02:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:20,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:20,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:20,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:02:20,664 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash -238767924, now seen corresponding path program 4 times [2022-11-02 21:02:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:20,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366064179] [2022-11-02 21:02:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:21,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:21,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366064179] [2022-11-02 21:02:21,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366064179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:21,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:21,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057532238] [2022-11-02 21:02:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:21,254 INFO L87 Difference]: Start difference. First operand 97 states and 179 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:21,760 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2022-11-02 21:02:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:02:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:21,762 INFO L225 Difference]: With dead ends: 135 [2022-11-02 21:02:21,762 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 21:02:21,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:02:21,763 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:21,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 21:02:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2022-11-02 21:02:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 103 states have (on average 1.9223300970873787) internal successors, (198), 106 states have internal predecessors, (198), 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) [2022-11-02 21:02:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 198 transitions. [2022-11-02 21:02:21,767 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 198 transitions. Word has length 9 [2022-11-02 21:02:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:21,767 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 198 transitions. [2022-11-02 21:02:21,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 198 transitions. [2022-11-02 21:02:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:21,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:21,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:21,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:02:21,768 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash -238767923, now seen corresponding path program 2 times [2022-11-02 21:02:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:21,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969635340] [2022-11-02 21:02:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969635340] [2022-11-02 21:02:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969635340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:22,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:22,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906865814] [2022-11-02 21:02:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:22,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:22,582 INFO L87 Difference]: Start difference. First operand 107 states and 198 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:23,357 INFO L93 Difference]: Finished difference Result 152 states and 258 transitions. [2022-11-02 21:02:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:02:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:23,359 INFO L225 Difference]: With dead ends: 152 [2022-11-02 21:02:23,359 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 21:02:23,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:02:23,361 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:23,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 21:02:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 111. [2022-11-02 21:02:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.9065420560747663) internal successors, (204), 110 states have internal predecessors, (204), 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) [2022-11-02 21:02:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 204 transitions. [2022-11-02 21:02:23,366 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 204 transitions. Word has length 9 [2022-11-02 21:02:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:23,367 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 204 transitions. [2022-11-02 21:02:23,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 204 transitions. [2022-11-02 21:02:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:23,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:23,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:23,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:02:23,368 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:23,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash -241939224, now seen corresponding path program 5 times [2022-11-02 21:02:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:23,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449693559] [2022-11-02 21:02:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:24,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449693559] [2022-11-02 21:02:24,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449693559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:24,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:24,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:24,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616608208] [2022-11-02 21:02:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:24,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:24,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:24,170 INFO L87 Difference]: Start difference. First operand 111 states and 204 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:25,011 INFO L93 Difference]: Finished difference Result 190 states and 321 transitions. [2022-11-02 21:02:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:02:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:25,013 INFO L225 Difference]: With dead ends: 190 [2022-11-02 21:02:25,013 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 21:02:25,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:02:25,014 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:25,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:02:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 21:02:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 114. [2022-11-02 21:02:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.9272727272727272) internal successors, (212), 113 states have internal predecessors, (212), 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) [2022-11-02 21:02:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 212 transitions. [2022-11-02 21:02:25,020 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 212 transitions. Word has length 9 [2022-11-02 21:02:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:25,020 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 212 transitions. [2022-11-02 21:02:25,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 212 transitions. [2022-11-02 21:02:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:25,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:25,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:25,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:02:25,025 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -241915974, now seen corresponding path program 6 times [2022-11-02 21:02:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:25,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299789457] [2022-11-02 21:02:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:25,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:25,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299789457] [2022-11-02 21:02:25,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299789457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:25,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:25,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377768928] [2022-11-02 21:02:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:25,470 INFO L87 Difference]: Start difference. First operand 114 states and 212 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:25,820 INFO L93 Difference]: Finished difference Result 137 states and 239 transitions. [2022-11-02 21:02:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:02:25,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:25,822 INFO L225 Difference]: With dead ends: 137 [2022-11-02 21:02:25,822 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 21:02:25,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:25,823 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:25,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 21:02:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2022-11-02 21:02:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.89) internal successors, (189), 102 states have internal predecessors, (189), 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) [2022-11-02 21:02:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 189 transitions. [2022-11-02 21:02:25,828 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 189 transitions. Word has length 9 [2022-11-02 21:02:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:25,829 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 189 transitions. [2022-11-02 21:02:25,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-11-02 21:02:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:25,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:25,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:25,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:02:25,831 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:25,831 INFO L85 PathProgramCache]: Analyzing trace with hash -223170894, now seen corresponding path program 7 times [2022-11-02 21:02:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071456977] [2022-11-02 21:02:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:26,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:26,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071456977] [2022-11-02 21:02:26,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071456977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:26,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:26,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095829932] [2022-11-02 21:02:26,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:26,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:26,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:26,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:26,320 INFO L87 Difference]: Start difference. First operand 103 states and 189 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:26,735 INFO L93 Difference]: Finished difference Result 167 states and 293 transitions. [2022-11-02 21:02:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:02:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:26,737 INFO L225 Difference]: With dead ends: 167 [2022-11-02 21:02:26,737 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 21:02:26,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:26,738 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:26,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 21:02:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2022-11-02 21:02:26,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.89) internal successors, (189), 102 states have internal predecessors, (189), 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) [2022-11-02 21:02:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 189 transitions. [2022-11-02 21:02:26,742 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 189 transitions. Word has length 9 [2022-11-02 21:02:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:26,742 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 189 transitions. [2022-11-02 21:02:26,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-11-02 21:02:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:26,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:26,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:02:26,743 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash -218650163, now seen corresponding path program 3 times [2022-11-02 21:02:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985506557] [2022-11-02 21:02:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:27,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985506557] [2022-11-02 21:02:27,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985506557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:27,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:27,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471067389] [2022-11-02 21:02:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:27,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:27,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:27,541 INFO L87 Difference]: Start difference. First operand 103 states and 189 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:28,219 INFO L93 Difference]: Finished difference Result 117 states and 206 transitions. [2022-11-02 21:02:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:28,221 INFO L225 Difference]: With dead ends: 117 [2022-11-02 21:02:28,221 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 21:02:28,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:02:28,222 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:28,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 21:02:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2022-11-02 21:02:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 87 states have (on average 1.8735632183908046) internal successors, (163), 89 states have internal predecessors, (163), 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) [2022-11-02 21:02:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 163 transitions. [2022-11-02 21:02:28,227 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 163 transitions. Word has length 9 [2022-11-02 21:02:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:28,227 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 163 transitions. [2022-11-02 21:02:28,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2022-11-02 21:02:28,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:28,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:28,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:28,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:02:28,228 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:28,231 INFO L85 PathProgramCache]: Analyzing trace with hash 620701252, now seen corresponding path program 8 times [2022-11-02 21:02:28,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:28,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136664826] [2022-11-02 21:02:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:28,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136664826] [2022-11-02 21:02:28,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136664826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:28,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:28,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:28,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881435440] [2022-11-02 21:02:28,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:28,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:28,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:28,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:28,716 INFO L87 Difference]: Start difference. First operand 90 states and 163 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:29,150 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2022-11-02 21:02:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:29,152 INFO L225 Difference]: With dead ends: 112 [2022-11-02 21:02:29,152 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 21:02:29,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:02:29,153 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:29,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 21:02:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2022-11-02 21:02:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 85 states have (on average 1.8823529411764706) internal successors, (160), 87 states have internal predecessors, (160), 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) [2022-11-02 21:02:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 160 transitions. [2022-11-02 21:02:29,160 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 160 transitions. Word has length 9 [2022-11-02 21:02:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:29,160 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 160 transitions. [2022-11-02 21:02:29,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 160 transitions. [2022-11-02 21:02:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:29,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:29,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:29,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:02:29,162 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash 636298282, now seen corresponding path program 9 times [2022-11-02 21:02:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300712004] [2022-11-02 21:02:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:29,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300712004] [2022-11-02 21:02:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300712004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:29,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:29,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930732252] [2022-11-02 21:02:29,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:29,654 INFO L87 Difference]: Start difference. First operand 88 states and 160 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:30,124 INFO L93 Difference]: Finished difference Result 130 states and 221 transitions. [2022-11-02 21:02:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:02:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:30,126 INFO L225 Difference]: With dead ends: 130 [2022-11-02 21:02:30,126 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 21:02:30,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:02:30,127 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:30,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 21:02:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2022-11-02 21:02:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.837837837837838) internal successors, (136), 76 states have internal predecessors, (136), 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) [2022-11-02 21:02:30,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 136 transitions. [2022-11-02 21:02:30,131 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 136 transitions. Word has length 9 [2022-11-02 21:02:30,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:30,131 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 136 transitions. [2022-11-02 21:02:30,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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) [2022-11-02 21:02:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 136 transitions. [2022-11-02 21:02:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:30,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:30,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:30,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:02:30,141 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 640830660, now seen corresponding path program 4 times [2022-11-02 21:02:30,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:30,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831462164] [2022-11-02 21:02:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:31,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:31,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831462164] [2022-11-02 21:02:31,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831462164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:31,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:31,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005734234] [2022-11-02 21:02:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:31,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:31,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:31,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:31,059 INFO L87 Difference]: Start difference. First operand 77 states and 136 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:31,570 INFO L93 Difference]: Finished difference Result 92 states and 167 transitions. [2022-11-02 21:02:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:02:31,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:31,572 INFO L225 Difference]: With dead ends: 92 [2022-11-02 21:02:31,572 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 21:02:31,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:02:31,573 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:31,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 21:02:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2022-11-02 21:02:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 60 states have internal predecessors, (106), 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) [2022-11-02 21:02:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 106 transitions. [2022-11-02 21:02:31,576 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 106 transitions. Word has length 9 [2022-11-02 21:02:31,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:31,577 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 106 transitions. [2022-11-02 21:02:31,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 106 transitions. [2022-11-02 21:02:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:31,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:31,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:31,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:02:31,578 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash 542647658, now seen corresponding path program 10 times [2022-11-02 21:02:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862981691] [2022-11-02 21:02:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:31,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:32,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:32,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862981691] [2022-11-02 21:02:32,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862981691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:32,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:32,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334351286] [2022-11-02 21:02:32,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:32,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:32,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:32,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:32,344 INFO L87 Difference]: Start difference. First operand 61 states and 106 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:32,934 INFO L93 Difference]: Finished difference Result 80 states and 127 transitions. [2022-11-02 21:02:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:02:32,934 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:32,935 INFO L225 Difference]: With dead ends: 80 [2022-11-02 21:02:32,935 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 21:02:32,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:02:32,936 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:32,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 21:02:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2022-11-02 21:02:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 56 states have internal predecessors, (98), 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) [2022-11-02 21:02:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 98 transitions. [2022-11-02 21:02:32,939 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 98 transitions. Word has length 9 [2022-11-02 21:02:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:32,939 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 98 transitions. [2022-11-02 21:02:32,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2022-11-02 21:02:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 21:02:32,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:32,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:32,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:02:32,940 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash 542647659, now seen corresponding path program 4 times [2022-11-02 21:02:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:32,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710430661] [2022-11-02 21:02:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:33,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710430661] [2022-11-02 21:02:33,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710430661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:33,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:33,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733213582] [2022-11-02 21:02:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:33,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:33,670 INFO L87 Difference]: Start difference. First operand 57 states and 98 transitions. Second operand has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:34,296 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2022-11-02 21:02:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:02:34,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) Word has length 9 [2022-11-02 21:02:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:34,297 INFO L225 Difference]: With dead ends: 66 [2022-11-02 21:02:34,297 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 21:02:34,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:02:34,299 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:34,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 21:02:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-11-02 21:02:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 43 states have internal predecessors, (77), 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) [2022-11-02 21:02:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 77 transitions. [2022-11-02 21:02:34,302 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 77 transitions. Word has length 9 [2022-11-02 21:02:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:34,303 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 77 transitions. [2022-11-02 21:02:34,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.0) internal successors, (9), 9 states have internal predecessors, (9), 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) [2022-11-02 21:02:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2022-11-02 21:02:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:34,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:34,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:34,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:02:34,304 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:34,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash 758706195, now seen corresponding path program 1 times [2022-11-02 21:02:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:34,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477636383] [2022-11-02 21:02:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477636383] [2022-11-02 21:02:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477636383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:35,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:35,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:35,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071821023] [2022-11-02 21:02:35,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:35,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:35,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:35,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:35,327 INFO L87 Difference]: Start difference. First operand 44 states and 77 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:35,780 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2022-11-02 21:02:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:02:35,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:35,781 INFO L225 Difference]: With dead ends: 64 [2022-11-02 21:02:35,781 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:02:35,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:02:35,782 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:35,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:02:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2022-11-02 21:02:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.82) internal successors, (91), 51 states have internal predecessors, (91), 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) [2022-11-02 21:02:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 91 transitions. [2022-11-02 21:02:35,784 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 91 transitions. Word has length 13 [2022-11-02 21:02:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:35,785 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 91 transitions. [2022-11-02 21:02:35,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 91 transitions. [2022-11-02 21:02:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:35,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:35,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:35,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:02:35,787 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 758706196, now seen corresponding path program 1 times [2022-11-02 21:02:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348175111] [2022-11-02 21:02:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:37,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348175111] [2022-11-02 21:02:37,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348175111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:37,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:37,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:37,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390432729] [2022-11-02 21:02:37,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:37,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:37,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:37,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:37,054 INFO L87 Difference]: Start difference. First operand 52 states and 91 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:38,312 INFO L93 Difference]: Finished difference Result 68 states and 116 transitions. [2022-11-02 21:02:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:02:38,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:38,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:38,313 INFO L225 Difference]: With dead ends: 68 [2022-11-02 21:02:38,313 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:02:38,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:02:38,314 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:38,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:02:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:02:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-11-02 21:02:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.826086956521739) internal successors, (84), 47 states have internal predecessors, (84), 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) [2022-11-02 21:02:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 84 transitions. [2022-11-02 21:02:38,317 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 84 transitions. Word has length 13 [2022-11-02 21:02:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:38,317 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 84 transitions. [2022-11-02 21:02:38,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 84 transitions. [2022-11-02 21:02:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:38,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:38,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:38,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:02:38,318 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:38,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash 758817795, now seen corresponding path program 2 times [2022-11-02 21:02:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:38,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016685961] [2022-11-02 21:02:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:39,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:39,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016685961] [2022-11-02 21:02:39,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016685961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:39,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:39,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740884616] [2022-11-02 21:02:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:39,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:39,148 INFO L87 Difference]: Start difference. First operand 48 states and 84 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:39,717 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2022-11-02 21:02:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:39,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:39,719 INFO L225 Difference]: With dead ends: 64 [2022-11-02 21:02:39,719 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:02:39,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:39,720 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:39,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:02:39,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2022-11-02 21:02:39,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.78) internal successors, (89), 51 states have internal predecessors, (89), 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) [2022-11-02 21:02:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2022-11-02 21:02:39,722 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 13 [2022-11-02 21:02:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:39,723 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2022-11-02 21:02:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2022-11-02 21:02:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:39,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:39,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:39,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 21:02:39,724 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 758817796, now seen corresponding path program 2 times [2022-11-02 21:02:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:39,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311565885] [2022-11-02 21:02:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311565885] [2022-11-02 21:02:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311565885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:40,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863201977] [2022-11-02 21:02:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:40,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:40,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:40,813 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:42,084 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2022-11-02 21:02:42,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:02:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:42,085 INFO L225 Difference]: With dead ends: 73 [2022-11-02 21:02:42,085 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 21:02:42,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-02 21:02:42,086 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:42,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 21:02:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-11-02 21:02:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 52 states have internal predecessors, (88), 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) [2022-11-02 21:02:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 88 transitions. [2022-11-02 21:02:42,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 88 transitions. Word has length 13 [2022-11-02 21:02:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:42,089 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 88 transitions. [2022-11-02 21:02:42,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 88 transitions. [2022-11-02 21:02:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:42,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:42,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:42,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 21:02:42,090 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash 785024265, now seen corresponding path program 3 times [2022-11-02 21:02:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:42,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363590597] [2022-11-02 21:02:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:42,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:42,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363590597] [2022-11-02 21:02:42,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363590597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:42,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:42,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269444555] [2022-11-02 21:02:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:42,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:42,708 INFO L87 Difference]: Start difference. First operand 53 states and 88 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:43,249 INFO L93 Difference]: Finished difference Result 69 states and 104 transitions. [2022-11-02 21:02:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:43,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:43,251 INFO L225 Difference]: With dead ends: 69 [2022-11-02 21:02:43,251 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 21:02:43,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:43,252 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:43,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 21:02:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-11-02 21:02:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 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) [2022-11-02 21:02:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2022-11-02 21:02:43,255 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 13 [2022-11-02 21:02:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:43,255 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 84 transitions. [2022-11-02 21:02:43,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2022-11-02 21:02:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:43,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:43,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:43,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 21:02:43,256 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash -906208457, now seen corresponding path program 4 times [2022-11-02 21:02:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:43,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969363629] [2022-11-02 21:02:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:43,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:43,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969363629] [2022-11-02 21:02:43,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969363629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:43,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:43,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:43,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63876055] [2022-11-02 21:02:43,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:43,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:43,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:43,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:43,860 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:44,375 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2022-11-02 21:02:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:44,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:44,377 INFO L225 Difference]: With dead ends: 61 [2022-11-02 21:02:44,377 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 21:02:44,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:44,378 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:44,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 21:02:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-11-02 21:02:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 42 states have internal predecessors, (74), 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) [2022-11-02 21:02:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-11-02 21:02:44,380 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 13 [2022-11-02 21:02:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:44,381 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-11-02 21:02:44,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-11-02 21:02:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:44,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:44,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:44,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 21:02:44,381 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:44,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash 715673319, now seen corresponding path program 5 times [2022-11-02 21:02:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:44,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98911171] [2022-11-02 21:02:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:45,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98911171] [2022-11-02 21:02:45,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98911171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:45,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:45,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367738298] [2022-11-02 21:02:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:45,011 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:45,530 INFO L93 Difference]: Finished difference Result 91 states and 147 transitions. [2022-11-02 21:02:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:02:45,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:45,531 INFO L225 Difference]: With dead ends: 91 [2022-11-02 21:02:45,532 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 21:02:45,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:02:45,532 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:45,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 21:02:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2022-11-02 21:02:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.8867924528301887) internal successors, (100), 54 states have internal predecessors, (100), 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) [2022-11-02 21:02:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 100 transitions. [2022-11-02 21:02:45,535 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 100 transitions. Word has length 13 [2022-11-02 21:02:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:45,536 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 100 transitions. [2022-11-02 21:02:45,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 100 transitions. [2022-11-02 21:02:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:45,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:45,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:45,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 21:02:45,537 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 715673320, now seen corresponding path program 3 times [2022-11-02 21:02:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:45,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324276742] [2022-11-02 21:02:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:46,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:46,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324276742] [2022-11-02 21:02:46,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324276742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:46,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:46,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384121538] [2022-11-02 21:02:46,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:46,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:46,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:46,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:46,405 INFO L87 Difference]: Start difference. First operand 55 states and 100 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:47,676 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2022-11-02 21:02:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:02:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:47,677 INFO L225 Difference]: With dead ends: 81 [2022-11-02 21:02:47,677 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 21:02:47,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:02:47,678 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:47,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 21:02:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2022-11-02 21:02:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 58 states have internal predecessors, (107), 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) [2022-11-02 21:02:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 107 transitions. [2022-11-02 21:02:47,681 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 107 transitions. Word has length 13 [2022-11-02 21:02:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:47,681 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 107 transitions. [2022-11-02 21:02:47,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2022-11-02 21:02:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:47,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:47,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:47,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 21:02:47,683 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash 715784919, now seen corresponding path program 6 times [2022-11-02 21:02:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:47,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907880064] [2022-11-02 21:02:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:48,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907880064] [2022-11-02 21:02:48,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907880064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:48,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:48,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406694283] [2022-11-02 21:02:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:48,592 INFO L87 Difference]: Start difference. First operand 59 states and 107 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:49,302 INFO L93 Difference]: Finished difference Result 95 states and 149 transitions. [2022-11-02 21:02:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:02:49,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:49,303 INFO L225 Difference]: With dead ends: 95 [2022-11-02 21:02:49,303 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 21:02:49,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:02:49,305 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:49,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:49,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 21:02:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2022-11-02 21:02:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 62 states have internal predecessors, (112), 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) [2022-11-02 21:02:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 112 transitions. [2022-11-02 21:02:49,308 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 112 transitions. Word has length 13 [2022-11-02 21:02:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 112 transitions. [2022-11-02 21:02:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 112 transitions. [2022-11-02 21:02:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:49,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:49,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:49,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 21:02:49,310 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:49,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash 715784920, now seen corresponding path program 4 times [2022-11-02 21:02:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:49,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102682230] [2022-11-02 21:02:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:50,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102682230] [2022-11-02 21:02:50,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102682230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:50,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:50,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279513865] [2022-11-02 21:02:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:50,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:50,192 INFO L87 Difference]: Start difference. First operand 63 states and 112 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:51,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:51,669 INFO L93 Difference]: Finished difference Result 89 states and 141 transitions. [2022-11-02 21:02:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 21:02:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:51,670 INFO L225 Difference]: With dead ends: 89 [2022-11-02 21:02:51,671 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 21:02:51,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2022-11-02 21:02:51,672 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:51,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:02:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 21:02:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-11-02 21:02:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 60 states have internal predecessors, (107), 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) [2022-11-02 21:02:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 107 transitions. [2022-11-02 21:02:51,676 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 107 transitions. Word has length 13 [2022-11-02 21:02:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:51,676 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 107 transitions. [2022-11-02 21:02:51,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 107 transitions. [2022-11-02 21:02:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:51,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:51,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:51,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 21:02:51,678 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash 710710839, now seen corresponding path program 7 times [2022-11-02 21:02:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:51,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962557600] [2022-11-02 21:02:51,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:52,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962557600] [2022-11-02 21:02:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962557600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972683273] [2022-11-02 21:02:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:52,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:52,334 INFO L87 Difference]: Start difference. First operand 61 states and 107 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:52,956 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2022-11-02 21:02:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:52,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:52,958 INFO L225 Difference]: With dead ends: 87 [2022-11-02 21:02:52,958 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 21:02:52,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:52,959 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:52,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:02:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 21:02:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-11-02 21:02:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.7538461538461538) internal successors, (114), 66 states have internal predecessors, (114), 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) [2022-11-02 21:02:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 114 transitions. [2022-11-02 21:02:52,962 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 114 transitions. Word has length 13 [2022-11-02 21:02:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:52,963 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 114 transitions. [2022-11-02 21:02:52,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2022-11-02 21:02:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:52,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:52,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:52,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 21:02:52,964 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash 710710840, now seen corresponding path program 5 times [2022-11-02 21:02:52,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:52,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257553005] [2022-11-02 21:02:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:52,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:53,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257553005] [2022-11-02 21:02:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257553005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:53,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:53,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818548309] [2022-11-02 21:02:53,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:53,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:53,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:53,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:53,872 INFO L87 Difference]: Start difference. First operand 67 states and 114 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:55,012 INFO L93 Difference]: Finished difference Result 85 states and 133 transitions. [2022-11-02 21:02:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:02:55,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:55,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:55,014 INFO L225 Difference]: With dead ends: 85 [2022-11-02 21:02:55,014 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 21:02:55,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2022-11-02 21:02:55,015 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:55,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 21:02:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-11-02 21:02:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 64 states have internal predecessors, (112), 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) [2022-11-02 21:02:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 112 transitions. [2022-11-02 21:02:55,018 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 112 transitions. Word has length 13 [2022-11-02 21:02:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:55,019 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 112 transitions. [2022-11-02 21:02:55,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 112 transitions. [2022-11-02 21:02:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:55,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:55,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:55,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 21:02:55,020 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:55,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1685370369, now seen corresponding path program 8 times [2022-11-02 21:02:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:55,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239709473] [2022-11-02 21:02:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:55,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239709473] [2022-11-02 21:02:55,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239709473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:55,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:55,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:55,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304241612] [2022-11-02 21:02:55,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:55,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:55,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:55,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:55,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:55,739 INFO L87 Difference]: Start difference. First operand 65 states and 112 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:56,287 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2022-11-02 21:02:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:56,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:56,289 INFO L225 Difference]: With dead ends: 79 [2022-11-02 21:02:56,289 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 21:02:56,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:02:56,290 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:56,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 21:02:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-11-02 21:02:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.7704918032786885) internal successors, (108), 62 states have internal predecessors, (108), 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) [2022-11-02 21:02:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 108 transitions. [2022-11-02 21:02:56,293 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 108 transitions. Word has length 13 [2022-11-02 21:02:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:56,293 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 108 transitions. [2022-11-02 21:02:56,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 108 transitions. [2022-11-02 21:02:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:56,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:56,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:56,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 21:02:56,295 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1685481969, now seen corresponding path program 9 times [2022-11-02 21:02:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943167680] [2022-11-02 21:02:56,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:56,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:57,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:57,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943167680] [2022-11-02 21:02:57,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943167680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:57,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:57,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:02:57,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867172861] [2022-11-02 21:02:57,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:57,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:02:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:57,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:02:57,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:57,227 INFO L87 Difference]: Start difference. First operand 63 states and 108 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:57,858 INFO L93 Difference]: Finished difference Result 85 states and 130 transitions. [2022-11-02 21:02:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:02:57,858 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:57,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:57,859 INFO L225 Difference]: With dead ends: 85 [2022-11-02 21:02:57,859 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 21:02:57,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:02:57,860 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:57,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:02:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 21:02:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2022-11-02 21:02:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 63 states have internal predecessors, (109), 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) [2022-11-02 21:02:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 109 transitions. [2022-11-02 21:02:57,863 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 109 transitions. Word has length 13 [2022-11-02 21:02:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:57,863 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 109 transitions. [2022-11-02 21:02:57,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:02:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 109 transitions. [2022-11-02 21:02:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:57,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:57,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:57,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 21:02:57,864 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1711688439, now seen corresponding path program 10 times [2022-11-02 21:02:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:57,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515369409] [2022-11-02 21:02:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:58,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515369409] [2022-11-02 21:02:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515369409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:58,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604422935] [2022-11-02 21:02:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:58,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:58,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:58,373 INFO L87 Difference]: Start difference. First operand 64 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:58,816 INFO L93 Difference]: Finished difference Result 86 states and 129 transitions. [2022-11-02 21:02:58,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:02:58,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:58,817 INFO L225 Difference]: With dead ends: 86 [2022-11-02 21:02:58,818 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 21:02:58,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:02:58,818 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:58,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 21:02:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2022-11-02 21:02:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.721311475409836) internal successors, (105), 62 states have internal predecessors, (105), 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) [2022-11-02 21:02:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 105 transitions. [2022-11-02 21:02:58,821 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 105 transitions. Word has length 13 [2022-11-02 21:02:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:58,821 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 105 transitions. [2022-11-02 21:02:58,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 105 transitions. [2022-11-02 21:02:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:58,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:58,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:58,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 21:02:58,822 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:58,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:58,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1403351589, now seen corresponding path program 11 times [2022-11-02 21:02:58,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:58,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601725771] [2022-11-02 21:02:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:02:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601725771] [2022-11-02 21:02:59,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601725771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:59,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:59,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:02:59,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632381536] [2022-11-02 21:02:59,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:59,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:02:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:59,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:02:59,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:59,315 INFO L87 Difference]: Start difference. First operand 63 states and 105 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:59,842 INFO L93 Difference]: Finished difference Result 85 states and 129 transitions. [2022-11-02 21:02:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:02:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:02:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:59,844 INFO L225 Difference]: With dead ends: 85 [2022-11-02 21:02:59,844 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 21:02:59,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:02:59,845 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:59,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:02:59,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 21:02:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-11-02 21:02:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 66 states have internal predecessors, (111), 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) [2022-11-02 21:02:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 111 transitions. [2022-11-02 21:02:59,849 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 111 transitions. Word has length 13 [2022-11-02 21:02:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:59,849 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 111 transitions. [2022-11-02 21:02:59,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:02:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 111 transitions. [2022-11-02 21:02:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:59,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:59,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:59,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 21:02:59,851 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:02:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1434632139, now seen corresponding path program 12 times [2022-11-02 21:02:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301690072] [2022-11-02 21:02:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:00,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301690072] [2022-11-02 21:03:00,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301690072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:00,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:00,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833128817] [2022-11-02 21:03:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:00,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:00,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:00,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:00,436 INFO L87 Difference]: Start difference. First operand 67 states and 111 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:00,967 INFO L93 Difference]: Finished difference Result 81 states and 123 transitions. [2022-11-02 21:03:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:00,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:00,968 INFO L225 Difference]: With dead ends: 81 [2022-11-02 21:03:00,968 INFO L226 Difference]: Without dead ends: 69 [2022-11-02 21:03:00,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:00,969 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:00,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:00,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-02 21:03:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2022-11-02 21:03:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 60 states have internal predecessors, (98), 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) [2022-11-02 21:03:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 98 transitions. [2022-11-02 21:03:00,972 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 98 transitions. Word has length 13 [2022-11-02 21:03:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:00,972 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 98 transitions. [2022-11-02 21:03:00,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 98 transitions. [2022-11-02 21:03:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:00,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:00,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:00,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 21:03:00,974 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1770234115, now seen corresponding path program 13 times [2022-11-02 21:03:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:00,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846891073] [2022-11-02 21:03:00,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:00,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:01,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846891073] [2022-11-02 21:03:01,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846891073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:01,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:01,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460422141] [2022-11-02 21:03:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:01,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:01,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:01,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:01,606 INFO L87 Difference]: Start difference. First operand 61 states and 98 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:02,202 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2022-11-02 21:03:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:02,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:02,203 INFO L225 Difference]: With dead ends: 81 [2022-11-02 21:03:02,203 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 21:03:02,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:02,204 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:02,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 21:03:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2022-11-02 21:03:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.679245283018868) internal successors, (89), 54 states have internal predecessors, (89), 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) [2022-11-02 21:03:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 89 transitions. [2022-11-02 21:03:02,208 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 89 transitions. Word has length 13 [2022-11-02 21:03:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:02,209 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 89 transitions. [2022-11-02 21:03:02,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 89 transitions. [2022-11-02 21:03:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:02,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:02,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:02,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 21:03:02,210 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash -869340405, now seen corresponding path program 14 times [2022-11-02 21:03:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:02,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133066280] [2022-11-02 21:03:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133066280] [2022-11-02 21:03:02,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133066280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:02,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:02,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:02,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790286202] [2022-11-02 21:03:02,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:02,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:02,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:02,761 INFO L87 Difference]: Start difference. First operand 55 states and 89 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:03,328 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-11-02 21:03:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:03:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:03,329 INFO L225 Difference]: With dead ends: 71 [2022-11-02 21:03:03,329 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:03:03,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:03:03,330 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:03,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:03:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-11-02 21:03:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 53 states have internal predecessors, (87), 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) [2022-11-02 21:03:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 87 transitions. [2022-11-02 21:03:03,334 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 87 transitions. Word has length 13 [2022-11-02 21:03:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:03,334 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 87 transitions. [2022-11-02 21:03:03,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2022-11-02 21:03:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:03,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:03,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:03,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 21:03:03,335 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash 514744759, now seen corresponding path program 15 times [2022-11-02 21:03:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:03,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675607121] [2022-11-02 21:03:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:03,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:03,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675607121] [2022-11-02 21:03:03,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675607121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:03,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:03,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951266038] [2022-11-02 21:03:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:03,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:03,912 INFO L87 Difference]: Start difference. First operand 54 states and 87 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:04,479 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2022-11-02 21:03:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:04,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:04,481 INFO L225 Difference]: With dead ends: 60 [2022-11-02 21:03:04,481 INFO L226 Difference]: Without dead ends: 54 [2022-11-02 21:03:04,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:04,482 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:04,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-02 21:03:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-11-02 21:03:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.66) internal successors, (83), 51 states have internal predecessors, (83), 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) [2022-11-02 21:03:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-11-02 21:03:04,484 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 13 [2022-11-02 21:03:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:04,485 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-11-02 21:03:04,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-11-02 21:03:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:04,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:04,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:04,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 21:03:04,486 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:04,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 546025309, now seen corresponding path program 16 times [2022-11-02 21:03:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445664780] [2022-11-02 21:03:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:04,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445664780] [2022-11-02 21:03:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445664780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:05,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:05,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:05,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737846813] [2022-11-02 21:03:05,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:05,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:05,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:05,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:05,092 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:05,703 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-11-02 21:03:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:05,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:05,705 INFO L225 Difference]: With dead ends: 52 [2022-11-02 21:03:05,705 INFO L226 Difference]: Without dead ends: 38 [2022-11-02 21:03:05,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:05,706 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:05,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:05,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-02 21:03:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-02 21:03:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 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) [2022-11-02 21:03:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 63 transitions. [2022-11-02 21:03:05,708 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 63 transitions. Word has length 13 [2022-11-02 21:03:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:05,708 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 63 transitions. [2022-11-02 21:03:05,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 63 transitions. [2022-11-02 21:03:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:05,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:05,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:05,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 21:03:05,709 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1430114543, now seen corresponding path program 17 times [2022-11-02 21:03:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:05,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148353174] [2022-11-02 21:03:05,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:06,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148353174] [2022-11-02 21:03:06,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148353174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:06,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:06,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752804417] [2022-11-02 21:03:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:06,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:06,464 INFO L87 Difference]: Start difference. First operand 38 states and 63 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:07,108 INFO L93 Difference]: Finished difference Result 65 states and 101 transitions. [2022-11-02 21:03:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:03:07,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:07,109 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:03:07,109 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 21:03:07,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:03:07,109 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:07,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 21:03:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2022-11-02 21:03:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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) [2022-11-02 21:03:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-11-02 21:03:07,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 13 [2022-11-02 21:03:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:07,113 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-11-02 21:03:07,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-11-02 21:03:07,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:07,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:07,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:07,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 21:03:07,114 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:07,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1430114544, now seen corresponding path program 6 times [2022-11-02 21:03:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:07,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204018662] [2022-11-02 21:03:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:07,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204018662] [2022-11-02 21:03:07,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204018662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:07,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:07,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332410243] [2022-11-02 21:03:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:07,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:07,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:07,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:07,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:07,990 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:09,651 INFO L93 Difference]: Finished difference Result 65 states and 101 transitions. [2022-11-02 21:03:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:03:09,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:09,652 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:03:09,652 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 21:03:09,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:03:09,653 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:09,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:03:09,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 21:03:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2022-11-02 21:03:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 50 states have internal predecessors, (85), 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) [2022-11-02 21:03:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2022-11-02 21:03:09,655 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 13 [2022-11-02 21:03:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:09,655 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2022-11-02 21:03:09,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2022-11-02 21:03:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:09,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:09,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:09,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 21:03:09,656 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1430226143, now seen corresponding path program 18 times [2022-11-02 21:03:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:09,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084720669] [2022-11-02 21:03:09,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:10,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:10,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084720669] [2022-11-02 21:03:10,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084720669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:10,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:10,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621351587] [2022-11-02 21:03:10,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:10,292 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:10,829 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2022-11-02 21:03:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:03:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:10,831 INFO L225 Difference]: With dead ends: 71 [2022-11-02 21:03:10,832 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 21:03:10,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:03:10,832 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:10,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 21:03:10,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2022-11-02 21:03:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.6981132075471699) internal successors, (90), 54 states have internal predecessors, (90), 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) [2022-11-02 21:03:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2022-11-02 21:03:10,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 13 [2022-11-02 21:03:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:10,836 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 90 transitions. [2022-11-02 21:03:10,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 90 transitions. [2022-11-02 21:03:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:10,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:10,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:10,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 21:03:10,837 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1430226144, now seen corresponding path program 7 times [2022-11-02 21:03:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:10,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603203677] [2022-11-02 21:03:10,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:11,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603203677] [2022-11-02 21:03:11,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603203677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:11,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:11,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534664791] [2022-11-02 21:03:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:11,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:11,562 INFO L87 Difference]: Start difference. First operand 55 states and 90 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:12,664 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2022-11-02 21:03:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:03:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:12,665 INFO L225 Difference]: With dead ends: 87 [2022-11-02 21:03:12,665 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 21:03:12,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:03:12,666 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:12,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:03:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 21:03:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 52. [2022-11-02 21:03:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.68) internal successors, (84), 51 states have internal predecessors, (84), 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) [2022-11-02 21:03:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2022-11-02 21:03:12,669 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 13 [2022-11-02 21:03:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:12,670 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2022-11-02 21:03:12,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2022-11-02 21:03:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:12,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:12,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:12,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 21:03:12,671 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1425152063, now seen corresponding path program 19 times [2022-11-02 21:03:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:12,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726664260] [2022-11-02 21:03:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:13,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:13,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726664260] [2022-11-02 21:03:13,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726664260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:13,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:13,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286814098] [2022-11-02 21:03:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:13,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:13,129 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:13,481 INFO L93 Difference]: Finished difference Result 64 states and 96 transitions. [2022-11-02 21:03:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:03:13,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:13,482 INFO L225 Difference]: With dead ends: 64 [2022-11-02 21:03:13,482 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:03:13,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:03:13,483 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:13,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:03:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-11-02 21:03:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.625) internal successors, (91), 57 states have internal predecessors, (91), 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) [2022-11-02 21:03:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 91 transitions. [2022-11-02 21:03:13,485 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 91 transitions. Word has length 13 [2022-11-02 21:03:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:13,485 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 91 transitions. [2022-11-02 21:03:13,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 91 transitions. [2022-11-02 21:03:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:13,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:13,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:13,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 21:03:13,486 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:13,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1425152064, now seen corresponding path program 8 times [2022-11-02 21:03:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:13,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324534327] [2022-11-02 21:03:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:14,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:14,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324534327] [2022-11-02 21:03:14,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324534327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:14,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:14,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390200502] [2022-11-02 21:03:14,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:14,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:14,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:14,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:14,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:14,175 INFO L87 Difference]: Start difference. First operand 58 states and 91 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:15,195 INFO L93 Difference]: Finished difference Result 70 states and 101 transitions. [2022-11-02 21:03:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:03:15,196 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:15,196 INFO L225 Difference]: With dead ends: 70 [2022-11-02 21:03:15,196 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 21:03:15,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-11-02 21:03:15,197 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:15,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 21:03:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-11-02 21:03:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.64) internal successors, (82), 51 states have internal predecessors, (82), 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) [2022-11-02 21:03:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2022-11-02 21:03:15,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 13 [2022-11-02 21:03:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:15,199 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 82 transitions. [2022-11-02 21:03:15,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2022-11-02 21:03:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:15,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:15,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:15,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 21:03:15,201 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1605781465, now seen corresponding path program 20 times [2022-11-02 21:03:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:15,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129268981] [2022-11-02 21:03:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:15,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129268981] [2022-11-02 21:03:15,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129268981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:15,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:15,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:03:15,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480239179] [2022-11-02 21:03:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:15,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:03:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:03:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:03:15,906 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-11-02 21:03:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:16,675 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2022-11-02 21:03:16,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:03:16,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:16,676 INFO L225 Difference]: With dead ends: 62 [2022-11-02 21:03:16,676 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 21:03:16,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:03:16,677 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:16,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 21:03:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-11-02 21:03:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.625) internal successors, (78), 49 states have internal predecessors, (78), 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) [2022-11-02 21:03:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 78 transitions. [2022-11-02 21:03:16,679 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 78 transitions. Word has length 13 [2022-11-02 21:03:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:16,680 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 78 transitions. [2022-11-02 21:03:16,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-11-02 21:03:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 78 transitions. [2022-11-02 21:03:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:16,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:16,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 21:03:16,681 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1605669865, now seen corresponding path program 21 times [2022-11-02 21:03:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:16,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121541886] [2022-11-02 21:03:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:17,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:17,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121541886] [2022-11-02 21:03:17,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121541886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:17,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:17,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:17,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431833372] [2022-11-02 21:03:17,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:17,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:17,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:17,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:17,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:17,551 INFO L87 Difference]: Start difference. First operand 50 states and 78 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:18,493 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2022-11-02 21:03:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:03:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:18,495 INFO L225 Difference]: With dead ends: 103 [2022-11-02 21:03:18,495 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 21:03:18,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2022-11-02 21:03:18,496 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:18,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:03:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 21:03:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 54. [2022-11-02 21:03:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 53 states have internal predecessors, (87), 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) [2022-11-02 21:03:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 87 transitions. [2022-11-02 21:03:18,498 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 87 transitions. Word has length 13 [2022-11-02 21:03:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:18,499 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 87 transitions. [2022-11-02 21:03:18,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2022-11-02 21:03:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:18,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:18,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:18,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 21:03:18,500 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1610743945, now seen corresponding path program 22 times [2022-11-02 21:03:18,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981594576] [2022-11-02 21:03:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981594576] [2022-11-02 21:03:19,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981594576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632781059] [2022-11-02 21:03:19,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:19,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:19,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:19,249 INFO L87 Difference]: Start difference. First operand 54 states and 87 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:19,924 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2022-11-02 21:03:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:03:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:19,925 INFO L225 Difference]: With dead ends: 93 [2022-11-02 21:03:19,926 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 21:03:19,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:03:19,927 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:19,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 21:03:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 52. [2022-11-02 21:03:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.64) internal successors, (82), 51 states have internal predecessors, (82), 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) [2022-11-02 21:03:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2022-11-02 21:03:19,930 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 13 [2022-11-02 21:03:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:19,930 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 82 transitions. [2022-11-02 21:03:19,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2022-11-02 21:03:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:19,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:19,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:19,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 21:03:19,931 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash -635972815, now seen corresponding path program 23 times [2022-11-02 21:03:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441776577] [2022-11-02 21:03:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:20,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441776577] [2022-11-02 21:03:20,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441776577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:20,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:20,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691275047] [2022-11-02 21:03:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:20,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:20,646 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:21,296 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2022-11-02 21:03:21,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:03:21,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:21,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:21,298 INFO L225 Difference]: With dead ends: 70 [2022-11-02 21:03:21,298 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:03:21,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:03:21,301 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:21,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:03:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2022-11-02 21:03:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.62) internal successors, (81), 51 states have internal predecessors, (81), 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) [2022-11-02 21:03:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 81 transitions. [2022-11-02 21:03:21,304 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 81 transitions. Word has length 13 [2022-11-02 21:03:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:21,305 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 81 transitions. [2022-11-02 21:03:21,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-11-02 21:03:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:21,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:21,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:21,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 21:03:21,306 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash -609766345, now seen corresponding path program 24 times [2022-11-02 21:03:21,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:21,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736829259] [2022-11-02 21:03:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:21,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736829259] [2022-11-02 21:03:21,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736829259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:21,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:21,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133386048] [2022-11-02 21:03:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:21,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:21,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:21,888 INFO L87 Difference]: Start difference. First operand 52 states and 81 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:22,493 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2022-11-02 21:03:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:22,494 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:22,494 INFO L225 Difference]: With dead ends: 73 [2022-11-02 21:03:22,494 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 21:03:22,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:22,495 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:22,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 21:03:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-02 21:03:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 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) [2022-11-02 21:03:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2022-11-02 21:03:22,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 13 [2022-11-02 21:03:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:22,498 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2022-11-02 21:03:22,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2022-11-02 21:03:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:22,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:22,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:22,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 21:03:22,499 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:22,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:22,500 INFO L85 PathProgramCache]: Analyzing trace with hash -918103195, now seen corresponding path program 25 times [2022-11-02 21:03:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:22,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159339124] [2022-11-02 21:03:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:22,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:22,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159339124] [2022-11-02 21:03:22,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159339124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:22,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:22,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793387113] [2022-11-02 21:03:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:22,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:22,997 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:23,471 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2022-11-02 21:03:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:03:23,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:23,472 INFO L225 Difference]: With dead ends: 63 [2022-11-02 21:03:23,472 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 21:03:23,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:03:23,472 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:23,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 21:03:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-11-02 21:03:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 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) [2022-11-02 21:03:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2022-11-02 21:03:23,475 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2022-11-02 21:03:23,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:23,476 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2022-11-02 21:03:23,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:23,476 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2022-11-02 21:03:23,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:23,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:23,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:23,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 21:03:23,477 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash -886822645, now seen corresponding path program 26 times [2022-11-02 21:03:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:23,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074667717] [2022-11-02 21:03:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074667717] [2022-11-02 21:03:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074667717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:23,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:03:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844020238] [2022-11-02 21:03:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:23,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:23,976 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:24,574 INFO L93 Difference]: Finished difference Result 71 states and 97 transitions. [2022-11-02 21:03:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:24,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:24,576 INFO L225 Difference]: With dead ends: 71 [2022-11-02 21:03:24,576 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 21:03:24,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:24,576 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:24,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 21:03:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2022-11-02 21:03:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 45 states have internal predecessors, (62), 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) [2022-11-02 21:03:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-11-02 21:03:24,580 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 13 [2022-11-02 21:03:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:24,580 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-11-02 21:03:24,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 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) [2022-11-02 21:03:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-11-02 21:03:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:24,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:24,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:24,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 21:03:24,582 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1148180705, now seen corresponding path program 27 times [2022-11-02 21:03:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:24,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287528244] [2022-11-02 21:03:24,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:24,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:25,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:25,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287528244] [2022-11-02 21:03:25,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287528244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:25,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:25,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940938730] [2022-11-02 21:03:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:25,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:25,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:25,663 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:26,338 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-11-02 21:03:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:03:26,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:26,339 INFO L225 Difference]: With dead ends: 54 [2022-11-02 21:03:26,339 INFO L226 Difference]: Without dead ends: 48 [2022-11-02 21:03:26,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-02 21:03:26,340 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:26,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-02 21:03:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-11-02 21:03:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.380952380952381) internal successors, (58), 43 states have internal predecessors, (58), 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) [2022-11-02 21:03:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-11-02 21:03:26,342 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 13 [2022-11-02 21:03:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:26,342 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-11-02 21:03:26,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-11-02 21:03:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:26,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:26,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:26,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 21:03:26,343 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1143106625, now seen corresponding path program 28 times [2022-11-02 21:03:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:26,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730707850] [2022-11-02 21:03:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:27,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:27,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730707850] [2022-11-02 21:03:27,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730707850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:27,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:27,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590416994] [2022-11-02 21:03:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:27,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:27,076 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:27,554 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-11-02 21:03:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:03:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:27,555 INFO L225 Difference]: With dead ends: 46 [2022-11-02 21:03:27,555 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 21:03:27,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:03:27,556 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:27,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 21:03:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-11-02 21:03:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 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) [2022-11-02 21:03:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-02 21:03:27,558 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 13 [2022-11-02 21:03:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:27,559 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-02 21:03:27,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-11-02 21:03:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:27,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:27,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:27,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 21:03:27,560 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:27,560 INFO L85 PathProgramCache]: Analyzing trace with hash -219098476, now seen corresponding path program 9 times [2022-11-02 21:03:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:27,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237463560] [2022-11-02 21:03:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237463560] [2022-11-02 21:03:28,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237463560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:28,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:28,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856531737] [2022-11-02 21:03:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:28,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:28,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:28,440 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:29,160 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-11-02 21:03:29,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:03:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:29,165 INFO L225 Difference]: With dead ends: 34 [2022-11-02 21:03:29,165 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 21:03:29,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:03:29,166 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:29,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:03:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 21:03:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 21:03:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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) [2022-11-02 21:03:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-02 21:03:29,174 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2022-11-02 21:03:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:29,175 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-02 21:03:29,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:29,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-02 21:03:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:29,175 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:29,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:29,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 21:03:29,176 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:29,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1839842957, now seen corresponding path program 29 times [2022-11-02 21:03:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304845274] [2022-11-02 21:03:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:30,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:30,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304845274] [2022-11-02 21:03:30,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304845274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:30,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:30,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84517713] [2022-11-02 21:03:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:30,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:30,146 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:30,844 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-11-02 21:03:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:03:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:30,845 INFO L225 Difference]: With dead ends: 25 [2022-11-02 21:03:30,845 INFO L226 Difference]: Without dead ends: 25 [2022-11-02 21:03:30,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:03:30,846 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:30,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-02 21:03:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-02 21:03:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 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) [2022-11-02 21:03:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-11-02 21:03:30,848 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 13 [2022-11-02 21:03:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:30,849 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-11-02 21:03:30,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-11-02 21:03:30,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:30,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:30,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:30,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 21:03:30,850 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1839842958, now seen corresponding path program 10 times [2022-11-02 21:03:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:30,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574638110] [2022-11-02 21:03:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:31,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574638110] [2022-11-02 21:03:31,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574638110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:31,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:31,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723743153] [2022-11-02 21:03:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:31,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:31,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:31,765 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:32,391 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-11-02 21:03:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:03:32,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:32,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:32,392 INFO L225 Difference]: With dead ends: 25 [2022-11-02 21:03:32,392 INFO L226 Difference]: Without dead ends: 21 [2022-11-02 21:03:32,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:03:32,393 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:32,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-02 21:03:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-02 21:03:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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) [2022-11-02 21:03:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-02 21:03:32,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2022-11-02 21:03:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:32,395 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-02 21:03:32,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-02 21:03:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:32,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:32,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:32,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 21:03:32,396 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1839954557, now seen corresponding path program 30 times [2022-11-02 21:03:32,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:32,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185491798] [2022-11-02 21:03:32,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:32,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:33,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:33,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185491798] [2022-11-02 21:03:33,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185491798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:33,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:33,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:33,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295334431] [2022-11-02 21:03:33,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:33,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:33,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:33,336 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:34,092 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-11-02 21:03:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:03:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:34,093 INFO L225 Difference]: With dead ends: 27 [2022-11-02 21:03:34,094 INFO L226 Difference]: Without dead ends: 27 [2022-11-02 21:03:34,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:03:34,094 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:34,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-02 21:03:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-11-02 21:03:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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) [2022-11-02 21:03:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-02 21:03:34,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 13 [2022-11-02 21:03:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:34,097 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-02 21:03:34,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-02 21:03:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:34,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:34,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:34,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-02 21:03:34,099 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1839954558, now seen corresponding path program 11 times [2022-11-02 21:03:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:34,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413469160] [2022-11-02 21:03:34,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:34,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:35,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:35,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413469160] [2022-11-02 21:03:35,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413469160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:35,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:35,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009625879] [2022-11-02 21:03:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:35,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:35,149 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:35,906 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-11-02 21:03:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:03:35,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:35,907 INFO L225 Difference]: With dead ends: 25 [2022-11-02 21:03:35,907 INFO L226 Difference]: Without dead ends: 19 [2022-11-02 21:03:35,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:03:35,909 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:35,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 21:03:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-02 21:03:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-02 21:03:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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) [2022-11-02 21:03:35,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-02 21:03:35,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2022-11-02 21:03:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:35,911 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-02 21:03:35,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-02 21:03:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:35,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:35,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:35,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-02 21:03:35,913 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1834880477, now seen corresponding path program 31 times [2022-11-02 21:03:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:35,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366311739] [2022-11-02 21:03:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:36,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:36,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366311739] [2022-11-02 21:03:36,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366311739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:36,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:36,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:03:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838659007] [2022-11-02 21:03:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:36,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:03:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:36,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:03:36,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:03:36,765 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-11-02 21:03:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:37,355 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-11-02 21:03:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:03:37,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:37,356 INFO L225 Difference]: With dead ends: 17 [2022-11-02 21:03:37,356 INFO L226 Difference]: Without dead ends: 17 [2022-11-02 21:03:37,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:03:37,357 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:37,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:03:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-02 21:03:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-02 21:03:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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) [2022-11-02 21:03:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-02 21:03:37,359 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2022-11-02 21:03:37,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:37,360 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-02 21:03:37,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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) [2022-11-02 21:03:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-02 21:03:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:03:37,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:37,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:37,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-02 21:03:37,361 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 21:03:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:37,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1834880478, now seen corresponding path program 12 times [2022-11-02 21:03:37,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:37,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797477354] [2022-11-02 21:03:37,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:37,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:38,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797477354] [2022-11-02 21:03:38,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797477354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:38,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:38,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:03:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780735985] [2022-11-02 21:03:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:38,425 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:38,950 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-11-02 21:03:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:03:38,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) Word has length 13 [2022-11-02 21:03:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:38,951 INFO L225 Difference]: With dead ends: 15 [2022-11-02 21:03:38,951 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:03:38,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:03:38,952 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:38,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:03:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:03:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:03:38,953 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) [2022-11-02 21:03:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:03:38,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-11-02 21:03:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:38,953 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:03:38,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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) [2022-11-02 21:03:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:03:38,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:03:38,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-02 21:03:38,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2022-11-02 21:03:38,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-02 21:03:38,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-02 21:03:38,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-02 21:03:38,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-02 21:03:38,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-02 21:03:38,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-02 21:03:38,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-02 21:03:38,972 INFO L444 BasicCegarLoop]: Path program histogram: [31, 12, 10, 4, 4, 2, 2, 2, 1, 1, 1] [2022-11-02 21:03:38,978 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 21:03:38,978 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:03:38,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:03:38 BasicIcfg [2022-11-02 21:03:38,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:03:38,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:03:38,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:03:38,983 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:03:38,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:01:00" (3/4) ... [2022-11-02 21:03:38,987 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:03:38,995 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2022-11-02 21:03:39,005 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-02 21:03:39,015 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 21:03:39,015 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 21:03:39,015 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:03:39,076 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:03:39,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:03:39,077 INFO L158 Benchmark]: Toolchain (without parser) took 160701.57ms. Allocated memory was 109.1MB in the beginning and 488.6MB in the end (delta: 379.6MB). Free memory was 69.8MB in the beginning and 417.0MB in the end (delta: -347.2MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,078 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 109.1MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:03:39,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1121.60ms. Allocated memory is still 109.1MB. Free memory was 69.6MB in the beginning and 79.3MB in the end (delta: -9.7MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.78ms. Allocated memory is still 109.1MB. Free memory was 79.3MB in the beginning and 76.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,080 INFO L158 Benchmark]: Boogie Preprocessor took 69.70ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,080 INFO L158 Benchmark]: RCFGBuilder took 721.32ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 49.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,080 INFO L158 Benchmark]: TraceAbstraction took 158584.60ms. Allocated memory was 109.1MB in the beginning and 488.6MB in the end (delta: 379.6MB). Free memory was 49.0MB in the beginning and 420.1MB in the end (delta: -371.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,080 INFO L158 Benchmark]: Witness Printer took 94.16ms. Allocated memory is still 488.6MB. Free memory was 420.1MB in the beginning and 417.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:03:39,087 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 109.1MB. Free memory is still 89.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1121.60ms. Allocated memory is still 109.1MB. Free memory was 69.6MB in the beginning and 79.3MB in the end (delta: -9.7MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.78ms. Allocated memory is still 109.1MB. Free memory was 79.3MB in the beginning and 76.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.70ms. Allocated memory is still 109.1MB. Free memory was 76.2MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 721.32ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 49.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 158584.60ms. Allocated memory was 109.1MB in the beginning and 488.6MB in the end (delta: 379.6MB). Free memory was 49.0MB in the beginning and 420.1MB in the end (delta: -371.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 94.16ms. Allocated memory is still 488.6MB. Free memory was 420.1MB in the beginning and 417.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.0s, 163 PlacesBefore, 33 PlacesAfterwards, 163 TransitionsBefore, 30 TransitionsAfterwards, 2856 CoEnabledTransitionPairs, 7 FixpointIterations, 77 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 25 ConcurrentYvCompositions, 3 ChoiceCompositions, 171 TotalNumberOfCompositions, 5972 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2799, positive: 2603, positive conditional: 0, positive unconditional: 2603, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2050, positive: 1988, positive conditional: 0, positive unconditional: 1988, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2050, positive: 1978, positive conditional: 0, positive unconditional: 1978, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43941, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 298, negative conditional: 0, negative unconditional: 298, unknown: 43540, unknown conditional: 0, unknown unconditional: 43540] ], Cache Queries: [ total: 2799, positive: 615, positive conditional: 0, positive unconditional: 615, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 2050, unknown conditional: 0, unknown unconditional: 2050] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1699]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1699]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 172 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 158.4s, OverallIterations: 70, TraceHistogramMax: 1, PathProgramHistogramMax: 31, EmptinessCheckTime: 0.0s, AutomataDifference: 45.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 60.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3296 SdHoareTripleChecker+Valid, 20.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3296 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1901 mSDsCounter, 1378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11708 IncrementalHoareTripleChecker+Invalid, 13086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1378 mSolverCounterUnsat, 8 mSDtfsCounter, 11708 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1065 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1055 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=0, InterpolantAutomatonStates: 818, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 70 MinimizatonAttempts, 1144 StatesRemovedByMinimization, 60 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 49.7s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 11469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 70 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 21:03:39,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7001c616-8a95-4d8c-b2d8-b1b198388f3b/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE