./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/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_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/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_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/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 fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db --- 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 20:45:41,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:45:41,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:45:41,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:45:41,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:45:41,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:45:41,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:45:41,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:45:41,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:45:41,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:45:41,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:45:41,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:45:41,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:45:41,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:45:41,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:45:41,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:45:41,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:45:41,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:45:41,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:45:41,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:45:41,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:45:41,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:45:41,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:45:41,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:45:41,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:45:41,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:45:41,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:45:41,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:45:41,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:45:41,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:45:41,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:45:41,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:45:41,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:45:41,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:45:41,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:45:41,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:45:41,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:45:41,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:45:41,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:45:41,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:45:41,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:45:41,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-02 20:45:41,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:45:41,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:45:41,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:45:41,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:45:41,460 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:45:41,460 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:45:41,461 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:45:41,461 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:45:41,461 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:45:41,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:45:41,463 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:45:41,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:45:41,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:45:41,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:45:41,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:45:41,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:45:41,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:45:41,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:45:41,465 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-02 20:45:41,465 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:45:41,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:45:41,465 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:45:41,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:45:41,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:45:41,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:45:41,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:45:41,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:41,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:45:41,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:45:41,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:45:41,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:45:41,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:45:41,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:45:41,469 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_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/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_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/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 -> fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db [2022-11-02 20:45:41,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:45:41,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:45:41,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:45:41,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:45:41,849 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:45:41,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2022-11-02 20:45:41,919 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/data/7641d9d30/286273e5b5804bbbb09af5f526abc689/FLAG65543ab2e [2022-11-02 20:45:42,572 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:45:42,572 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2022-11-02 20:45:42,600 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/data/7641d9d30/286273e5b5804bbbb09af5f526abc689/FLAG65543ab2e [2022-11-02 20:45:42,767 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/data/7641d9d30/286273e5b5804bbbb09af5f526abc689 [2022-11-02 20:45:42,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:45:42,774 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:45:42,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:42,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:45:42,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:45:42,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bcd4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:42, skipping insertion in model container [2022-11-02 20:45:42,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:45:42" (1/1) ... [2022-11-02 20:45:42,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:45:42,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:45:43,706 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_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2022-11-02 20:45:43,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:43,749 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:45:43,792 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_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2022-11-02 20:45:43,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:45:43,919 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:45:43,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43 WrapperNode [2022-11-02 20:45:43,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:45:43,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:43,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:45:43,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:45:43,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:43,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:43,983 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-11-02 20:45:43,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:45:43,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:45:43,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:45:43,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:45:43,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:43,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:43,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:43,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:44,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:44,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:44,018 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:44,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:44,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:45:44,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:45:44,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:45:44,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:45:44,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (1/1) ... [2022-11-02 20:45:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:45:44,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:44,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:44,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:45:44,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:45:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:45:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:45:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:45:44,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:45:44,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:45:44,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:45:44,129 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-11-02 20:45:44,130 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-11-02 20:45:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:45:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:45:44,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:45:44,132 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 20:45:44,499 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:45:44,502 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:45:44,872 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:45:44,880 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:45:44,884 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:45:44,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:44 BoogieIcfgContainer [2022-11-02 20:45:44,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:45:44,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:45:44,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:45:44,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:45:44,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:45:42" (1/3) ... [2022-11-02 20:45:44,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3849a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:44, skipping insertion in model container [2022-11-02 20:45:44,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:45:43" (2/3) ... [2022-11-02 20:45:44,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3849a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:45:44, skipping insertion in model container [2022-11-02 20:45:44,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:44" (3/3) ... [2022-11-02 20:45:44,899 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-11-02 20:45:44,911 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:45:44,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:45:44,922 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:45:44,922 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:45:45,050 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:45:45,115 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-02 20:45:45,133 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 197 transitions, 410 flow [2022-11-02 20:45:45,141 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 197 transitions, 410 flow [2022-11-02 20:45:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 197 transitions, 410 flow [2022-11-02 20:45:45,266 INFO L130 PetriNetUnfolder]: 10/240 cut-off events. [2022-11-02 20:45:45,266 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:45:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 240 events. 10/240 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 417 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2022-11-02 20:45:45,275 INFO L118 LiptonReduction]: Number of co-enabled transitions 4500 [2022-11-02 20:47:15,456 INFO L133 LiptonReduction]: Checked pairs total: 9878 [2022-11-02 20:47:15,456 INFO L135 LiptonReduction]: Total number of compositions: 214 [2022-11-02 20:47:15,464 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 34 transitions, 84 flow [2022-11-02 20:47:15,516 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 456 states, 436 states have (on average 2.782110091743119) internal successors, (1213), 455 states have internal predecessors, (1213), 0 states have call successors, (0), 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 20:47:15,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:15,540 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;@4b21c3d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:15,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-02 20:47:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 456 states, 436 states have (on average 2.782110091743119) internal successors, (1213), 455 states have internal predecessors, (1213), 0 states have call successors, (0), 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 20:47:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-02 20:47:15,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:15,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-02 20:47:15,551 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash 653867963, now seen corresponding path program 1 times [2022-11-02 20:47:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:15,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118975354] [2022-11-02 20:47:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:16,785 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 20:47:16,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:16,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118975354] [2022-11-02 20:47:16,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118975354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:16,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:16,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:16,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115531032] [2022-11-02 20:47:16,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:16,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:16,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:16,825 INFO L87 Difference]: Start difference. First operand has 456 states, 436 states have (on average 2.782110091743119) internal successors, (1213), 455 states have internal predecessors, (1213), 0 states have call successors, (0), 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.25) internal successors, (5), 4 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 20:47:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:17,033 INFO L93 Difference]: Finished difference Result 454 states and 1149 transitions. [2022-11-02 20:47:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:17,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 20:47:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:17,049 INFO L225 Difference]: With dead ends: 454 [2022-11-02 20:47:17,049 INFO L226 Difference]: Without dead ends: 416 [2022-11-02 20:47:17,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:17,054 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:17,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-02 20:47:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-11-02 20:47:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 400 states have (on average 2.6075) internal successors, (1043), 415 states have internal predecessors, (1043), 0 states have call successors, (0), 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 20:47:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1043 transitions. [2022-11-02 20:47:17,141 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1043 transitions. Word has length 5 [2022-11-02 20:47:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:17,142 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1043 transitions. [2022-11-02 20:47:17,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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 20:47:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1043 transitions. [2022-11-02 20:47:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:47:17,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:17,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:47:17,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:17,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1204905821, now seen corresponding path program 1 times [2022-11-02 20:47:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:17,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964079104] [2022-11-02 20:47:17,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:17,809 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 20:47:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:17,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964079104] [2022-11-02 20:47:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964079104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:17,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:17,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642142971] [2022-11-02 20:47:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:17,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:17,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:17,818 INFO L87 Difference]: Start difference. First operand 416 states and 1043 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 20:47:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:18,090 INFO L93 Difference]: Finished difference Result 437 states and 1103 transitions. [2022-11-02 20:47:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:18,091 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 20:47:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:18,095 INFO L225 Difference]: With dead ends: 437 [2022-11-02 20:47:18,095 INFO L226 Difference]: Without dead ends: 437 [2022-11-02 20:47:18,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:18,097 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:18,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-02 20:47:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 430. [2022-11-02 20:47:18,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 414 states have (on average 2.6159420289855073) internal successors, (1083), 429 states have internal predecessors, (1083), 0 states have call successors, (0), 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 20:47:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1083 transitions. [2022-11-02 20:47:18,135 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1083 transitions. Word has length 6 [2022-11-02 20:47:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:18,136 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 1083 transitions. [2022-11-02 20:47:18,136 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 20:47:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1083 transitions. [2022-11-02 20:47:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:47:18,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:18,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:47:18,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:18,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1204927211, now seen corresponding path program 2 times [2022-11-02 20:47:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:18,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725533906] [2022-11-02 20:47:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:18,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:18,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 20:47:18,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:18,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725533906] [2022-11-02 20:47:18,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725533906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:18,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:18,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902817832] [2022-11-02 20:47:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:18,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:18,765 INFO L87 Difference]: Start difference. First operand 430 states and 1083 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 20:47:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:18,987 INFO L93 Difference]: Finished difference Result 416 states and 1043 transitions. [2022-11-02 20:47:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:18,987 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 20:47:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:18,990 INFO L225 Difference]: With dead ends: 416 [2022-11-02 20:47:18,990 INFO L226 Difference]: Without dead ends: 416 [2022-11-02 20:47:18,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:18,991 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:18,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-02 20:47:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 402. [2022-11-02 20:47:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 2.598445595854922) internal successors, (1003), 401 states have internal predecessors, (1003), 0 states have call successors, (0), 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 20:47:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1003 transitions. [2022-11-02 20:47:19,006 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 1003 transitions. Word has length 6 [2022-11-02 20:47:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:19,006 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 1003 transitions. [2022-11-02 20:47:19,006 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 20:47:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 1003 transitions. [2022-11-02 20:47:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:47:19,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:19,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:19,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:47:19,008 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1297600662, now seen corresponding path program 1 times [2022-11-02 20:47:19,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:19,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949778880] [2022-11-02 20:47:19,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:19,613 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 20:47:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:19,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949778880] [2022-11-02 20:47:19,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949778880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:19,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:19,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892337017] [2022-11-02 20:47:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:19,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:19,616 INFO L87 Difference]: Start difference. First operand 402 states and 1003 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 20:47:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:19,856 INFO L93 Difference]: Finished difference Result 390 states and 967 transitions. [2022-11-02 20:47:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 20:47:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:19,859 INFO L225 Difference]: With dead ends: 390 [2022-11-02 20:47:19,859 INFO L226 Difference]: Without dead ends: 390 [2022-11-02 20:47:19,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:19,860 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:19,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-02 20:47:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2022-11-02 20:47:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 2.585561497326203) internal successors, (967), 389 states have internal predecessors, (967), 0 states have call successors, (0), 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 20:47:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 967 transitions. [2022-11-02 20:47:19,876 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 967 transitions. Word has length 7 [2022-11-02 20:47:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:19,876 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 967 transitions. [2022-11-02 20:47:19,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 20:47:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 967 transitions. [2022-11-02 20:47:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:19,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:19,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:19,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:19,881 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 20:47:19,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1984704146, now seen corresponding path program 1 times [2022-11-02 20:47:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:19,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360819679] [2022-11-02 20:47:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:19,969 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 20:47:19,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:19,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360819679] [2022-11-02 20:47:19,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360819679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:19,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:19,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109948301] [2022-11-02 20:47:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:19,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:19,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:19,976 INFO L87 Difference]: Start difference. First operand 390 states and 967 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 20:47:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:20,065 INFO L93 Difference]: Finished difference Result 170 states and 379 transitions. [2022-11-02 20:47:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 20:47:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:20,066 INFO L225 Difference]: With dead ends: 170 [2022-11-02 20:47:20,067 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 20:47:20,067 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 20:47:20,068 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:20,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 20:47:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-02 20:47:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 2.3395061728395063) internal successors, (379), 169 states have internal predecessors, (379), 0 states have call successors, (0), 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 20:47:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 379 transitions. [2022-11-02 20:47:20,073 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 379 transitions. Word has length 9 [2022-11-02 20:47:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:20,073 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 379 transitions. [2022-11-02 20:47:20,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 20:47:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 379 transitions. [2022-11-02 20:47:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:20,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:20,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:47:20,081 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 20:47:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1984696575, now seen corresponding path program 1 times [2022-11-02 20:47:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:20,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848374275] [2022-11-02 20:47:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:20,842 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 20:47:20,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:20,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848374275] [2022-11-02 20:47:20,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848374275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:20,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:20,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430658799] [2022-11-02 20:47:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:20,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:20,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:20,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:20,844 INFO L87 Difference]: Start difference. First operand 170 states and 379 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 20:47:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:21,398 INFO L93 Difference]: Finished difference Result 191 states and 429 transitions. [2022-11-02 20:47:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:21,399 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 20:47:21,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:21,400 INFO L225 Difference]: With dead ends: 191 [2022-11-02 20:47:21,400 INFO L226 Difference]: Without dead ends: 191 [2022-11-02 20:47:21,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:21,401 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:21,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-02 20:47:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-11-02 20:47:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 183 states have (on average 2.3442622950819674) internal successors, (429), 190 states have internal predecessors, (429), 0 states have call successors, (0), 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 20:47:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 429 transitions. [2022-11-02 20:47:21,408 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 429 transitions. Word has length 9 [2022-11-02 20:47:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:21,409 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 429 transitions. [2022-11-02 20:47:21,409 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 20:47:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 429 transitions. [2022-11-02 20:47:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:21,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:21,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:21,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:47:21,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1909623255, now seen corresponding path program 2 times [2022-11-02 20:47:21,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:21,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548545777] [2022-11-02 20:47:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:22,183 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 20:47:22,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548545777] [2022-11-02 20:47:22,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548545777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:22,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:22,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934437041] [2022-11-02 20:47:22,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:22,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:22,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:22,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:22,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:22,185 INFO L87 Difference]: Start difference. First operand 191 states and 429 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 20:47:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:22,877 INFO L93 Difference]: Finished difference Result 230 states and 527 transitions. [2022-11-02 20:47:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:47:22,878 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 20:47:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:22,879 INFO L225 Difference]: With dead ends: 230 [2022-11-02 20:47:22,879 INFO L226 Difference]: Without dead ends: 230 [2022-11-02 20:47:22,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:22,880 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 44 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:22,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-02 20:47:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2022-11-02 20:47:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 2.349462365591398) internal successors, (437), 193 states have internal predecessors, (437), 0 states have call successors, (0), 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 20:47:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 437 transitions. [2022-11-02 20:47:22,888 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 437 transitions. Word has length 9 [2022-11-02 20:47:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:22,888 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 437 transitions. [2022-11-02 20:47:22,888 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 20:47:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 437 transitions. [2022-11-02 20:47:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:22,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:22,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:22,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:47:22,890 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 20:47:22,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:22,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1911723195, now seen corresponding path program 3 times [2022-11-02 20:47:22,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:22,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136359799] [2022-11-02 20:47:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:22,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:23,275 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 20:47:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136359799] [2022-11-02 20:47:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136359799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:23,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:23,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303845330] [2022-11-02 20:47:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:23,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:23,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:23,280 INFO L87 Difference]: Start difference. First operand 194 states and 437 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 20:47:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:23,439 INFO L93 Difference]: Finished difference Result 194 states and 416 transitions. [2022-11-02 20:47:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:23,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 20:47:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:23,442 INFO L225 Difference]: With dead ends: 194 [2022-11-02 20:47:23,443 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:47:23,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:23,443 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:23,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:47:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2022-11-02 20:47:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 174 states have (on average 2.293103448275862) internal successors, (399), 181 states have internal predecessors, (399), 0 states have call successors, (0), 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 20:47:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 399 transitions. [2022-11-02 20:47:23,449 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 399 transitions. Word has length 9 [2022-11-02 20:47:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:23,449 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 399 transitions. [2022-11-02 20:47:23,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 20:47:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 399 transitions. [2022-11-02 20:47:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:23,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:23,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:23,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:23,457 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 20:47:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1466927821, now seen corresponding path program 4 times [2022-11-02 20:47:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:23,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849146120] [2022-11-02 20:47:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:24,134 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 20:47:24,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:24,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849146120] [2022-11-02 20:47:24,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849146120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:24,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:24,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573687171] [2022-11-02 20:47:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:24,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:24,136 INFO L87 Difference]: Start difference. First operand 182 states and 399 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 20:47:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:24,861 INFO L93 Difference]: Finished difference Result 197 states and 433 transitions. [2022-11-02 20:47:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:24,861 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 20:47:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:24,863 INFO L225 Difference]: With dead ends: 197 [2022-11-02 20:47:24,863 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 20:47:24,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:47:24,864 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:24,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 20:47:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-02 20:47:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 2.291005291005291) internal successors, (433), 196 states have internal predecessors, (433), 0 states have call successors, (0), 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 20:47:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 433 transitions. [2022-11-02 20:47:24,871 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 433 transitions. Word has length 9 [2022-11-02 20:47:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:24,871 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 433 transitions. [2022-11-02 20:47:24,872 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 20:47:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 433 transitions. [2022-11-02 20:47:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:24,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:24,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:24,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:47:24,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:24,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1469027761, now seen corresponding path program 5 times [2022-11-02 20:47:24,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:24,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102524366] [2022-11-02 20:47:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:25,197 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 20:47:25,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:25,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102524366] [2022-11-02 20:47:25,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102524366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:25,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:25,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164543039] [2022-11-02 20:47:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:25,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:25,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:25,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:25,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:25,200 INFO L87 Difference]: Start difference. First operand 197 states and 433 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 20:47:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:25,344 INFO L93 Difference]: Finished difference Result 194 states and 404 transitions. [2022-11-02 20:47:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 20:47:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:25,346 INFO L225 Difference]: With dead ends: 194 [2022-11-02 20:47:25,346 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 20:47:25,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:25,347 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:25,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 5 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 20:47:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2022-11-02 20:47:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 2.265432098765432) internal successors, (367), 169 states have internal predecessors, (367), 0 states have call successors, (0), 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 20:47:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 367 transitions. [2022-11-02 20:47:25,353 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 367 transitions. Word has length 9 [2022-11-02 20:47:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:25,354 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 367 transitions. [2022-11-02 20:47:25,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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 20:47:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 367 transitions. [2022-11-02 20:47:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:25,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:25,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:47:25,355 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 20:47:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1453863181, now seen corresponding path program 6 times [2022-11-02 20:47:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:25,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341158816] [2022-11-02 20:47:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:26,066 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 20:47:26,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:26,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341158816] [2022-11-02 20:47:26,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341158816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:26,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:26,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348770957] [2022-11-02 20:47:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:26,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:26,068 INFO L87 Difference]: Start difference. First operand 170 states and 367 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 20:47:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:26,480 INFO L93 Difference]: Finished difference Result 185 states and 401 transitions. [2022-11-02 20:47:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:26,481 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 20:47:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:26,482 INFO L225 Difference]: With dead ends: 185 [2022-11-02 20:47:26,482 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 20:47:26,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:26,483 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 45 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:26,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 20:47:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-02 20:47:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 177 states have (on average 2.2655367231638417) internal successors, (401), 184 states have internal predecessors, (401), 0 states have call successors, (0), 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 20:47:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 401 transitions. [2022-11-02 20:47:26,490 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 401 transitions. Word has length 9 [2022-11-02 20:47:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:26,490 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 401 transitions. [2022-11-02 20:47:26,491 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 20:47:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 401 transitions. [2022-11-02 20:47:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:47:26,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:26,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:26,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:47:26,492 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:26,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1459196731, now seen corresponding path program 7 times [2022-11-02 20:47:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:26,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608030789] [2022-11-02 20:47:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:27,092 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 20:47:27,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:27,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608030789] [2022-11-02 20:47:27,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608030789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:27,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:27,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:47:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635890876] [2022-11-02 20:47:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:27,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:27,093 INFO L87 Difference]: Start difference. First operand 185 states and 401 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 20:47:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:27,516 INFO L93 Difference]: Finished difference Result 149 states and 305 transitions. [2022-11-02 20:47:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:27,516 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 20:47:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:27,519 INFO L225 Difference]: With dead ends: 149 [2022-11-02 20:47:27,519 INFO L226 Difference]: Without dead ends: 149 [2022-11-02 20:47:27,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:27,520 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:27,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-02 20:47:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 134. [2022-11-02 20:47:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 2.0846153846153848) internal successors, (271), 133 states have internal predecessors, (271), 0 states have call successors, (0), 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 20:47:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 271 transitions. [2022-11-02 20:47:27,526 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 271 transitions. Word has length 9 [2022-11-02 20:47:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:27,527 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 271 transitions. [2022-11-02 20:47:27,527 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 20:47:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 271 transitions. [2022-11-02 20:47:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:47:27,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:27,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:27,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:47:27,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1178891963, now seen corresponding path program 1 times [2022-11-02 20:47:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:27,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933380884] [2022-11-02 20:47:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:27,937 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 20:47:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:27,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933380884] [2022-11-02 20:47:27,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933380884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:27,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:27,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:47:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91997451] [2022-11-02 20:47:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:27,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:47:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:27,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:47:27,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:27,940 INFO L87 Difference]: Start difference. First operand 134 states and 271 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 20:47:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:28,321 INFO L93 Difference]: Finished difference Result 190 states and 364 transitions. [2022-11-02 20:47:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:47:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:47:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:28,323 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:47:28,323 INFO L226 Difference]: Without dead ends: 190 [2022-11-02 20:47:28,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:28,323 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 102 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:28,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 6 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-02 20:47:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 151. [2022-11-02 20:47:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.074829931972789) internal successors, (305), 150 states have internal predecessors, (305), 0 states have call successors, (0), 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 20:47:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 305 transitions. [2022-11-02 20:47:28,328 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 305 transitions. Word has length 11 [2022-11-02 20:47:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:28,329 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 305 transitions. [2022-11-02 20:47:28,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 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 20:47:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 305 transitions. [2022-11-02 20:47:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:47:28,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:28,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:28,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:47:28,330 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:28,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1178891902, now seen corresponding path program 1 times [2022-11-02 20:47:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:28,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516750204] [2022-11-02 20:47:28,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:28,746 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 20:47:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:28,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516750204] [2022-11-02 20:47:28,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516750204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:28,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:28,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:28,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364299644] [2022-11-02 20:47:28,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:28,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:28,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:28,749 INFO L87 Difference]: Start difference. First operand 151 states and 305 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 20:47:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:28,885 INFO L93 Difference]: Finished difference Result 86 states and 143 transitions. [2022-11-02 20:47:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:47:28,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:47:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:28,888 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:47:28,888 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:47:28,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:28,889 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:28,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:47:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:47:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-02 20:47:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.7439024390243902) internal successors, (143), 85 states have internal predecessors, (143), 0 states have call successors, (0), 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 20:47:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 143 transitions. [2022-11-02 20:47:28,892 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 143 transitions. Word has length 11 [2022-11-02 20:47:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:28,892 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 143 transitions. [2022-11-02 20:47:28,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 20:47:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 143 transitions. [2022-11-02 20:47:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:28,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:28,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:28,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:47:28,893 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 20:47:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1775664836, now seen corresponding path program 1 times [2022-11-02 20:47:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:28,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347606780] [2022-11-02 20:47:28,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:29,852 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 20:47:29,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:29,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347606780] [2022-11-02 20:47:29,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347606780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:29,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:29,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:29,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51588569] [2022-11-02 20:47:29,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:29,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:29,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:29,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:29,854 INFO L87 Difference]: Start difference. First operand 86 states and 143 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:30,638 INFO L93 Difference]: Finished difference Result 138 states and 231 transitions. [2022-11-02 20:47:30,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:47:30,639 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:30,640 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:47:30,640 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:47:30,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:47:30,641 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 98 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:30,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:30,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:47:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2022-11-02 20:47:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.7619047619047619) internal successors, (185), 108 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 20:47:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 185 transitions. [2022-11-02 20:47:30,646 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 185 transitions. Word has length 12 [2022-11-02 20:47:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:30,647 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 185 transitions. [2022-11-02 20:47:30,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 185 transitions. [2022-11-02 20:47:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:30,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:30,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:30,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:47:30,648 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:30,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:30,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1775664769, now seen corresponding path program 1 times [2022-11-02 20:47:30,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:30,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510552337] [2022-11-02 20:47:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:30,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:31,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 20:47:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:31,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510552337] [2022-11-02 20:47:31,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510552337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:31,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:31,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:31,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933451845] [2022-11-02 20:47:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:31,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:31,249 INFO L87 Difference]: Start difference. First operand 109 states and 185 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:31,898 INFO L93 Difference]: Finished difference Result 174 states and 298 transitions. [2022-11-02 20:47:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:31,899 INFO L225 Difference]: With dead ends: 174 [2022-11-02 20:47:31,899 INFO L226 Difference]: Without dead ends: 174 [2022-11-02 20:47:31,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:31,900 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 75 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:31,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 3 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-02 20:47:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-11-02 20:47:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.75) internal successors, (217), 127 states have internal predecessors, (217), 0 states have call successors, (0), 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 20:47:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 217 transitions. [2022-11-02 20:47:31,905 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 217 transitions. Word has length 12 [2022-11-02 20:47:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:31,906 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 217 transitions. [2022-11-02 20:47:31,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 217 transitions. [2022-11-02 20:47:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:31,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:31,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:31,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:47:31,907 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 20:47:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 144661917, now seen corresponding path program 2 times [2022-11-02 20:47:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:31,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904523138] [2022-11-02 20:47:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:32,507 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 20:47:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:32,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904523138] [2022-11-02 20:47:32,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904523138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:32,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:32,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:32,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542004854] [2022-11-02 20:47:32,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:32,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:32,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:32,509 INFO L87 Difference]: Start difference. First operand 128 states and 217 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:33,016 INFO L93 Difference]: Finished difference Result 174 states and 294 transitions. [2022-11-02 20:47:33,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:33,020 INFO L225 Difference]: With dead ends: 174 [2022-11-02 20:47:33,021 INFO L226 Difference]: Without dead ends: 174 [2022-11-02 20:47:33,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:33,026 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 92 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:33,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 3 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-02 20:47:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2022-11-02 20:47:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.7461538461538462) internal successors, (227), 133 states have internal predecessors, (227), 0 states have call successors, (0), 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 20:47:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 227 transitions. [2022-11-02 20:47:33,038 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 227 transitions. Word has length 12 [2022-11-02 20:47:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:33,038 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 227 transitions. [2022-11-02 20:47:33,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 227 transitions. [2022-11-02 20:47:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:33,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:33,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:33,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:47:33,040 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 20:47:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -399050300, now seen corresponding path program 2 times [2022-11-02 20:47:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:33,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690955057] [2022-11-02 20:47:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:34,028 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 20:47:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:34,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690955057] [2022-11-02 20:47:34,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690955057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:34,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:34,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203890012] [2022-11-02 20:47:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:34,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:34,031 INFO L87 Difference]: Start difference. First operand 134 states and 227 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:34,765 INFO L93 Difference]: Finished difference Result 164 states and 276 transitions. [2022-11-02 20:47:34,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:34,765 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:34,766 INFO L225 Difference]: With dead ends: 164 [2022-11-02 20:47:34,766 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:47:34,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:34,767 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 57 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:34,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:47:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 137. [2022-11-02 20:47:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 136 states have internal predecessors, (232), 0 states have call successors, (0), 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 20:47:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2022-11-02 20:47:34,772 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 12 [2022-11-02 20:47:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:34,773 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2022-11-02 20:47:34,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2022-11-02 20:47:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:34,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:34,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:34,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:47:34,778 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 20:47:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -399050233, now seen corresponding path program 3 times [2022-11-02 20:47:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:34,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739397496] [2022-11-02 20:47:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:35,374 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 20:47:35,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:35,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739397496] [2022-11-02 20:47:35,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739397496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:35,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:35,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:35,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553516609] [2022-11-02 20:47:35,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:35,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:35,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:35,376 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:35,868 INFO L93 Difference]: Finished difference Result 195 states and 323 transitions. [2022-11-02 20:47:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:35,870 INFO L225 Difference]: With dead ends: 195 [2022-11-02 20:47:35,870 INFO L226 Difference]: Without dead ends: 195 [2022-11-02 20:47:35,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:47:35,871 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 84 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:35,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 7 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-02 20:47:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 137. [2022-11-02 20:47:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.744360902255639) internal successors, (232), 136 states have internal predecessors, (232), 0 states have call successors, (0), 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 20:47:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 232 transitions. [2022-11-02 20:47:35,876 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 232 transitions. Word has length 12 [2022-11-02 20:47:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:35,876 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 232 transitions. [2022-11-02 20:47:35,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 232 transitions. [2022-11-02 20:47:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:35,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:35,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:35,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:47:35,878 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1105841422, now seen corresponding path program 3 times [2022-11-02 20:47:35,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:35,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735887436] [2022-11-02 20:47:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:36,803 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 20:47:36,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:36,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735887436] [2022-11-02 20:47:36,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735887436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:36,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:36,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:36,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387388124] [2022-11-02 20:47:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:36,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:36,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:36,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:36,806 INFO L87 Difference]: Start difference. First operand 137 states and 232 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:37,495 INFO L93 Difference]: Finished difference Result 158 states and 266 transitions. [2022-11-02 20:47:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:47:37,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:37,497 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:47:37,497 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:47:37,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:37,498 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:37,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:47:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 131. [2022-11-02 20:47:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.7480314960629921) internal successors, (222), 130 states have internal predecessors, (222), 0 states have call successors, (0), 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 20:47:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 222 transitions. [2022-11-02 20:47:37,502 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 222 transitions. Word has length 12 [2022-11-02 20:47:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:37,502 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 222 transitions. [2022-11-02 20:47:37,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:37,503 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 222 transitions. [2022-11-02 20:47:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:37,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:37,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:37,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:47:37,503 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 20:47:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1105841489, now seen corresponding path program 4 times [2022-11-02 20:47:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:37,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648345538] [2022-11-02 20:47:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:37,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:38,031 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 20:47:38,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:38,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648345538] [2022-11-02 20:47:38,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648345538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:38,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:38,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:38,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976246162] [2022-11-02 20:47:38,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:38,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:38,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:38,033 INFO L87 Difference]: Start difference. First operand 131 states and 222 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:38,543 INFO L93 Difference]: Finished difference Result 164 states and 271 transitions. [2022-11-02 20:47:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:38,545 INFO L225 Difference]: With dead ends: 164 [2022-11-02 20:47:38,545 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:47:38,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:38,546 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 76 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:38,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 5 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:47:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 128. [2022-11-02 20:47:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.75) internal successors, (217), 127 states have internal predecessors, (217), 0 states have call successors, (0), 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 20:47:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 217 transitions. [2022-11-02 20:47:38,550 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 217 transitions. Word has length 12 [2022-11-02 20:47:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:38,551 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 217 transitions. [2022-11-02 20:47:38,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 217 transitions. [2022-11-02 20:47:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:38,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:38,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:38,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:47:38,552 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:38,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2103180737, now seen corresponding path program 1 times [2022-11-02 20:47:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:38,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746300726] [2022-11-02 20:47:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:38,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:39,072 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 20:47:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746300726] [2022-11-02 20:47:39,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746300726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:39,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:39,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:39,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886186598] [2022-11-02 20:47:39,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:39,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:47:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:47:39,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:39,074 INFO L87 Difference]: Start difference. First operand 128 states and 217 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:39,565 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2022-11-02 20:47:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:39,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:39,566 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:47:39,567 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:47:39,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:39,568 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:39,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 3 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:47:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2022-11-02 20:47:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 122 states have (on average 1.7377049180327868) internal successors, (212), 124 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 20:47:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 212 transitions. [2022-11-02 20:47:39,572 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 212 transitions. Word has length 12 [2022-11-02 20:47:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:39,573 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 212 transitions. [2022-11-02 20:47:39,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 212 transitions. [2022-11-02 20:47:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:39,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:39,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:39,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:47:39,574 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2103180676, now seen corresponding path program 1 times [2022-11-02 20:47:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:39,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823524876] [2022-11-02 20:47:39,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:39,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:40,393 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 20:47:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823524876] [2022-11-02 20:47:40,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823524876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:40,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:40,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752901822] [2022-11-02 20:47:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:40,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:40,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:40,395 INFO L87 Difference]: Start difference. First operand 125 states and 212 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:41,060 INFO L93 Difference]: Finished difference Result 134 states and 228 transitions. [2022-11-02 20:47:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:47:41,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:41,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:41,061 INFO L225 Difference]: With dead ends: 134 [2022-11-02 20:47:41,061 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:47:41,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:47:41,062 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 47 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:41,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:47:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2022-11-02 20:47:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 100 states have internal predecessors, (172), 0 states have call successors, (0), 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 20:47:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 172 transitions. [2022-11-02 20:47:41,066 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 172 transitions. Word has length 12 [2022-11-02 20:47:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:41,066 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 172 transitions. [2022-11-02 20:47:41,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 172 transitions. [2022-11-02 20:47:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:41,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:41,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:41,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:47:41,067 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 20:47:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1723953039, now seen corresponding path program 5 times [2022-11-02 20:47:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:41,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763437300] [2022-11-02 20:47:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:41,490 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 20:47:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:41,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763437300] [2022-11-02 20:47:41,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763437300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:41,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:41,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:47:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858142113] [2022-11-02 20:47:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:41,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:47:41,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:41,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:47:41,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:41,492 INFO L87 Difference]: Start difference. First operand 101 states and 172 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:41,786 INFO L93 Difference]: Finished difference Result 137 states and 227 transitions. [2022-11-02 20:47:41,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:47:41,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:41,788 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:47:41,788 INFO L226 Difference]: Without dead ends: 137 [2022-11-02 20:47:41,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:47:41,789 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 78 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:41,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:47:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-02 20:47:41,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 99. [2022-11-02 20:47:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.7422680412371134) internal successors, (169), 98 states have internal predecessors, (169), 0 states have call successors, (0), 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 20:47:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 169 transitions. [2022-11-02 20:47:41,793 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 169 transitions. Word has length 12 [2022-11-02 20:47:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:41,794 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 169 transitions. [2022-11-02 20:47:41,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 169 transitions. [2022-11-02 20:47:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:41,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:41,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:41,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:47:41,795 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:41,796 INFO L85 PathProgramCache]: Analyzing trace with hash 196373647, now seen corresponding path program 6 times [2022-11-02 20:47:41,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:41,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149064966] [2022-11-02 20:47:41,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:41,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:42,458 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 20:47:42,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:42,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149064966] [2022-11-02 20:47:42,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149064966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:42,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:42,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:47:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441858029] [2022-11-02 20:47:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:42,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:47:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:47:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:47:42,460 INFO L87 Difference]: Start difference. First operand 99 states and 169 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:43,130 INFO L93 Difference]: Finished difference Result 137 states and 226 transitions. [2022-11-02 20:47:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:43,132 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:47:43,132 INFO L226 Difference]: Without dead ends: 137 [2022-11-02 20:47:43,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:47:43,133 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:43,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:43,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-02 20:47:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 76. [2022-11-02 20:47:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 75 states have internal predecessors, (126), 0 states have call successors, (0), 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 20:47:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 126 transitions. [2022-11-02 20:47:43,136 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 126 transitions. Word has length 12 [2022-11-02 20:47:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:43,136 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 126 transitions. [2022-11-02 20:47:43,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 126 transitions. [2022-11-02 20:47:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:43,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:43,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:43,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:47:43,137 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1900926592, now seen corresponding path program 4 times [2022-11-02 20:47:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:43,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683584188] [2022-11-02 20:47:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:43,918 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 20:47:43,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:43,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683584188] [2022-11-02 20:47:43,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683584188] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:43,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:43,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740751831] [2022-11-02 20:47:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:43,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:43,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:43,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:43,920 INFO L87 Difference]: Start difference. First operand 76 states and 126 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:44,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:44,606 INFO L93 Difference]: Finished difference Result 95 states and 154 transitions. [2022-11-02 20:47:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:47:44,607 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:44,608 INFO L225 Difference]: With dead ends: 95 [2022-11-02 20:47:44,608 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:47:44,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:44,609 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:44,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:47:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2022-11-02 20:47:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.6857142857142857) internal successors, (118), 71 states have internal predecessors, (118), 0 states have call successors, (0), 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 20:47:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2022-11-02 20:47:44,612 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 12 [2022-11-02 20:47:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:44,612 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2022-11-02 20:47:44,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2022-11-02 20:47:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:47:44,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:44,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:47:44,613 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1900926525, now seen corresponding path program 7 times [2022-11-02 20:47:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:44,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302035502] [2022-11-02 20:47:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:45,452 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 20:47:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:45,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302035502] [2022-11-02 20:47:45,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302035502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:45,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:45,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:47:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255011231] [2022-11-02 20:47:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:45,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:47:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:45,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:47:45,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:47:45,454 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:45,898 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2022-11-02 20:47:45,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:47:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:45,900 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:47:45,900 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:47:45,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:47:45,901 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:45,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:47:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2022-11-02 20:47:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 50 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 20:47:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-11-02 20:47:45,904 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 12 [2022-11-02 20:47:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:45,904 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-11-02 20:47:45,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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 20:47:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-11-02 20:47:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:45,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:45,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:45,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:47:45,906 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash 856156586, now seen corresponding path program 1 times [2022-11-02 20:47:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:45,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251304835] [2022-11-02 20:47:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,360 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 20:47:47,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:47,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251304835] [2022-11-02 20:47:47,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251304835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:47,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:47,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192729408] [2022-11-02 20:47:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:47,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:47,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:47,362 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,653 INFO L93 Difference]: Finished difference Result 105 states and 165 transitions. [2022-11-02 20:47:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:47:48,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,654 INFO L225 Difference]: With dead ends: 105 [2022-11-02 20:47:48,654 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:47:48,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:47:48,655 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:47:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2022-11-02 20:47:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 71 states have internal predecessors, (117), 0 states have call successors, (0), 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 20:47:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2022-11-02 20:47:48,657 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 16 [2022-11-02 20:47:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,657 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2022-11-02 20:47:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2022-11-02 20:47:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:48,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:47:48,658 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 856156653, now seen corresponding path program 1 times [2022-11-02 20:47:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947093433] [2022-11-02 20:47:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:49,565 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 20:47:49,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:49,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947093433] [2022-11-02 20:47:49,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947093433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:49,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:49,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:49,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76639789] [2022-11-02 20:47:49,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:49,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:49,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:49,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:49,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:49,567 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:50,411 INFO L93 Difference]: Finished difference Result 133 states and 214 transitions. [2022-11-02 20:47:50,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:50,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:50,412 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:47:50,413 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:47:50,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:50,413 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:50,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:47:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2022-11-02 20:47:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.6790123456790123) internal successors, (136), 82 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 20:47:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 136 transitions. [2022-11-02 20:47:50,417 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 136 transitions. Word has length 16 [2022-11-02 20:47:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:50,417 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 136 transitions. [2022-11-02 20:47:50,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 136 transitions. [2022-11-02 20:47:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:50,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:50,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:50,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:47:50,425 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 858018446, now seen corresponding path program 2 times [2022-11-02 20:47:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:50,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930076756] [2022-11-02 20:47:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:50,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:51,632 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 20:47:51,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:51,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930076756] [2022-11-02 20:47:51,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930076756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:51,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:51,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467874155] [2022-11-02 20:47:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:51,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:51,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:51,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:51,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:51,633 INFO L87 Difference]: Start difference. First operand 83 states and 136 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:52,907 INFO L93 Difference]: Finished difference Result 124 states and 196 transitions. [2022-11-02 20:47:52,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:47:52,907 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:52,908 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:47:52,908 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:47:52,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:47:52,910 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:52,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:47:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:47:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2022-11-02 20:47:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 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 20:47:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 142 transitions. [2022-11-02 20:47:52,914 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 142 transitions. Word has length 16 [2022-11-02 20:47:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:52,914 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 142 transitions. [2022-11-02 20:47:52,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 142 transitions. [2022-11-02 20:47:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:52,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:52,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:52,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:47:52,915 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash 858018513, now seen corresponding path program 2 times [2022-11-02 20:47:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862452316] [2022-11-02 20:47:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:53,830 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 20:47:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:53,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862452316] [2022-11-02 20:47:53,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862452316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:53,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:53,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:53,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650337784] [2022-11-02 20:47:53,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:53,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:53,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:53,831 INFO L87 Difference]: Start difference. First operand 87 states and 142 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:54,543 INFO L93 Difference]: Finished difference Result 143 states and 228 transitions. [2022-11-02 20:47:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:47:54,544 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:54,545 INFO L225 Difference]: With dead ends: 143 [2022-11-02 20:47:54,545 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:47:54,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:47:54,546 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 83 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:54,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:47:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 84. [2022-11-02 20:47:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.6585365853658536) internal successors, (136), 83 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 20:47:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2022-11-02 20:47:54,549 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 16 [2022-11-02 20:47:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:54,549 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2022-11-02 20:47:54,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2022-11-02 20:47:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:54,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:54,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:54,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:47:54,550 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 129196046, now seen corresponding path program 3 times [2022-11-02 20:47:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:54,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843627197] [2022-11-02 20:47:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:55,794 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 20:47:55,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843627197] [2022-11-02 20:47:55,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843627197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:55,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:55,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:47:55,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500914079] [2022-11-02 20:47:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:55,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:47:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:55,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:47:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:47:55,796 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:56,698 INFO L93 Difference]: Finished difference Result 113 states and 180 transitions. [2022-11-02 20:47:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:47:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:56,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:56,700 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:47:56,700 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:47:56,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:47:56,701 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 76 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:56,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:47:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:47:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2022-11-02 20:47:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.6511627906976745) internal successors, (142), 87 states have internal predecessors, (142), 0 states have call successors, (0), 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 20:47:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 142 transitions. [2022-11-02 20:47:56,704 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 142 transitions. Word has length 16 [2022-11-02 20:47:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:56,704 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 142 transitions. [2022-11-02 20:47:56,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 142 transitions. [2022-11-02 20:47:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:56,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:56,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:56,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:47:56,705 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 20:47:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash 129196113, now seen corresponding path program 3 times [2022-11-02 20:47:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:56,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285185100] [2022-11-02 20:47:56,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:57,516 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 20:47:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:57,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285185100] [2022-11-02 20:47:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285185100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:57,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821451929] [2022-11-02 20:47:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:57,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:57,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:57,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:57,518 INFO L87 Difference]: Start difference. First operand 88 states and 142 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:58,009 INFO L93 Difference]: Finished difference Result 136 states and 218 transitions. [2022-11-02 20:47:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:47:58,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:58,013 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:47:58,013 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:47:58,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:47:58,014 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 86 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:58,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:47:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2022-11-02 20:47:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.65) internal successors, (132), 81 states have internal predecessors, (132), 0 states have call successors, (0), 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 20:47:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 132 transitions. [2022-11-02 20:47:58,018 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 132 transitions. Word has length 16 [2022-11-02 20:47:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:58,018 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 132 transitions. [2022-11-02 20:47:58,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 132 transitions. [2022-11-02 20:47:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:58,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:58,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:58,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:47:58,020 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 20:47:58,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1142059603, now seen corresponding path program 4 times [2022-11-02 20:47:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:58,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103130374] [2022-11-02 20:47:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:58,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:58,827 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 20:47:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:58,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103130374] [2022-11-02 20:47:58,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103130374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:58,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:47:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557106072] [2022-11-02 20:47:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:47:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:47:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:47:58,829 INFO L87 Difference]: Start difference. First operand 82 states and 132 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:59,544 INFO L93 Difference]: Finished difference Result 137 states and 217 transitions. [2022-11-02 20:47:59,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:47:59,545 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:47:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:59,546 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:47:59,546 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:47:59,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:47:59,547 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:59,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:47:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:47:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 93. [2022-11-02 20:47:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.6703296703296704) internal successors, (152), 92 states have internal predecessors, (152), 0 states have call successors, (0), 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 20:47:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 152 transitions. [2022-11-02 20:47:59,554 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 152 transitions. Word has length 16 [2022-11-02 20:47:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:59,555 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 152 transitions. [2022-11-02 20:47:59,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:47:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 152 transitions. [2022-11-02 20:47:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:47:59,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:59,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:59,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-02 20:47:59,556 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:47:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1140197743, now seen corresponding path program 5 times [2022-11-02 20:47:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:59,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013924119] [2022-11-02 20:47:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:00,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 20:48:00,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013924119] [2022-11-02 20:48:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013924119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:00,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:00,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600089998] [2022-11-02 20:48:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:00,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:00,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:00,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:00,437 INFO L87 Difference]: Start difference. First operand 93 states and 152 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:01,250 INFO L93 Difference]: Finished difference Result 139 states and 219 transitions. [2022-11-02 20:48:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:01,252 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:48:01,252 INFO L226 Difference]: Without dead ends: 128 [2022-11-02 20:48:01,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:01,253 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 102 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:01,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-02 20:48:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2022-11-02 20:48:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.6590909090909092) internal successors, (146), 89 states have internal predecessors, (146), 0 states have call successors, (0), 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 20:48:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 146 transitions. [2022-11-02 20:48:01,257 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 146 transitions. Word has length 16 [2022-11-02 20:48:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:01,257 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 146 transitions. [2022-11-02 20:48:01,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 146 transitions. [2022-11-02 20:48:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:01,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:01,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:01,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-02 20:48:01,260 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 20:48:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1869020143, now seen corresponding path program 6 times [2022-11-02 20:48:01,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725970694] [2022-11-02 20:48:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,012 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 20:48:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:02,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725970694] [2022-11-02 20:48:02,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725970694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919851419] [2022-11-02 20:48:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:02,014 INFO L87 Difference]: Start difference. First operand 90 states and 146 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:02,588 INFO L93 Difference]: Finished difference Result 126 states and 200 transitions. [2022-11-02 20:48:02,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:02,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:02,590 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:48:02,590 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 20:48:02,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:02,591 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:02,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 20:48:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 86. [2022-11-02 20:48:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 84 states have (on average 1.6428571428571428) internal successors, (138), 85 states have internal predecessors, (138), 0 states have call successors, (0), 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 20:48:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2022-11-02 20:48:02,594 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 16 [2022-11-02 20:48:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:02,595 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2022-11-02 20:48:02,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2022-11-02 20:48:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:02,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:02,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:02,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-02 20:48:02,596 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1046854795, now seen corresponding path program 7 times [2022-11-02 20:48:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:02,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553878840] [2022-11-02 20:48:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:03,299 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 20:48:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:03,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553878840] [2022-11-02 20:48:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553878840] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:03,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:03,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973963951] [2022-11-02 20:48:03,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:03,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:03,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:03,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:03,301 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:03,978 INFO L93 Difference]: Finished difference Result 122 states and 190 transitions. [2022-11-02 20:48:03,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:03,979 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:48:03,979 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:48:03,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:03,980 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:03,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:48:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 91. [2022-11-02 20:48:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.6179775280898876) internal successors, (144), 90 states have internal predecessors, (144), 0 states have call successors, (0), 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 20:48:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2022-11-02 20:48:03,983 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 16 [2022-11-02 20:48:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:03,986 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2022-11-02 20:48:03,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2022-11-02 20:48:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:03,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:03,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:03,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-02 20:48:03,987 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 20:48:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1048716655, now seen corresponding path program 8 times [2022-11-02 20:48:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:03,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427127807] [2022-11-02 20:48:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:04,618 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 20:48:04,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:04,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427127807] [2022-11-02 20:48:04,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427127807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:04,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:04,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123376547] [2022-11-02 20:48:04,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:04,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:04,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:04,620 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:05,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:05,212 INFO L93 Difference]: Finished difference Result 114 states and 179 transitions. [2022-11-02 20:48:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:05,213 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:48:05,213 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:48:05,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:05,214 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:05,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:48:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2022-11-02 20:48:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.641025641025641) internal successors, (128), 79 states have internal predecessors, (128), 0 states have call successors, (0), 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 20:48:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2022-11-02 20:48:05,221 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 16 [2022-11-02 20:48:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:05,221 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2022-11-02 20:48:05,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2022-11-02 20:48:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:05,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:05,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:05,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-02 20:48:05,222 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 20:48:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash 364162268, now seen corresponding path program 4 times [2022-11-02 20:48:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:05,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507593973] [2022-11-02 20:48:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,243 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 20:48:06,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:06,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507593973] [2022-11-02 20:48:06,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507593973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:06,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:06,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515260636] [2022-11-02 20:48:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:06,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:06,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:06,245 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:06,981 INFO L93 Difference]: Finished difference Result 115 states and 177 transitions. [2022-11-02 20:48:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:06,981 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:06,982 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:48:06,982 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:48:06,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:06,983 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:06,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:48:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 89. [2022-11-02 20:48:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.6436781609195403) internal successors, (143), 88 states have internal predecessors, (143), 0 states have call successors, (0), 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 20:48:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2022-11-02 20:48:06,987 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 143 transitions. Word has length 16 [2022-11-02 20:48:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:06,987 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-11-02 20:48:06,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 143 transitions. [2022-11-02 20:48:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:06,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:06,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:06,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-02 20:48:06,988 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 20:48:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash 364162335, now seen corresponding path program 9 times [2022-11-02 20:48:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:06,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426859940] [2022-11-02 20:48:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:07,672 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 20:48:07,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:07,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426859940] [2022-11-02 20:48:07,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426859940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:07,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:07,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622559873] [2022-11-02 20:48:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:07,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:07,674 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:08,557 INFO L93 Difference]: Finished difference Result 164 states and 252 transitions. [2022-11-02 20:48:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:08,557 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:08,558 INFO L225 Difference]: With dead ends: 164 [2022-11-02 20:48:08,558 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:48:08,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:48:08,559 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:08,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 2 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:48:08,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 105. [2022-11-02 20:48:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 104 states have internal predecessors, (169), 0 states have call successors, (0), 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 20:48:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 169 transitions. [2022-11-02 20:48:08,564 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 169 transitions. Word has length 16 [2022-11-02 20:48:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:08,564 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 169 transitions. [2022-11-02 20:48:08,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 169 transitions. [2022-11-02 20:48:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:08,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:08,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:08,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-02 20:48:08,565 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:08,566 INFO L85 PathProgramCache]: Analyzing trace with hash 366024128, now seen corresponding path program 5 times [2022-11-02 20:48:08,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:08,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424524328] [2022-11-02 20:48:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:09,540 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 20:48:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:09,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424524328] [2022-11-02 20:48:09,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424524328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:09,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:09,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810005827] [2022-11-02 20:48:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:09,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:09,542 INFO L87 Difference]: Start difference. First operand 105 states and 169 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:10,230 INFO L93 Difference]: Finished difference Result 118 states and 185 transitions. [2022-11-02 20:48:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:10,231 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:10,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:10,232 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:48:10,232 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:48:10,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:10,233 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:10,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:48:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2022-11-02 20:48:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.6407766990291262) internal successors, (169), 104 states have internal predecessors, (169), 0 states have call successors, (0), 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 20:48:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 169 transitions. [2022-11-02 20:48:10,237 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 169 transitions. Word has length 16 [2022-11-02 20:48:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:10,237 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 169 transitions. [2022-11-02 20:48:10,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 169 transitions. [2022-11-02 20:48:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:10,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:10,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:10,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-02 20:48:10,238 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 20:48:10,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash 366024195, now seen corresponding path program 10 times [2022-11-02 20:48:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:10,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362456696] [2022-11-02 20:48:10,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:10,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:10,892 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 20:48:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362456696] [2022-11-02 20:48:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362456696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:10,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214880504] [2022-11-02 20:48:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:10,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:10,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:10,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:10,894 INFO L87 Difference]: Start difference. First operand 105 states and 169 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:11,604 INFO L93 Difference]: Finished difference Result 183 states and 280 transitions. [2022-11-02 20:48:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:11,606 INFO L225 Difference]: With dead ends: 183 [2022-11-02 20:48:11,606 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 20:48:11,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:11,607 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:11,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 2 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 20:48:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 107. [2022-11-02 20:48:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.6476190476190475) internal successors, (173), 106 states have internal predecessors, (173), 0 states have call successors, (0), 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 20:48:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 173 transitions. [2022-11-02 20:48:11,611 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 173 transitions. Word has length 16 [2022-11-02 20:48:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:11,612 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 173 transitions. [2022-11-02 20:48:11,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 173 transitions. [2022-11-02 20:48:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:11,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:11,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:11,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-02 20:48:11,613 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1514481750, now seen corresponding path program 6 times [2022-11-02 20:48:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:11,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719734114] [2022-11-02 20:48:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:12,571 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 20:48:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719734114] [2022-11-02 20:48:12,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719734114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:12,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:12,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58326024] [2022-11-02 20:48:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:12,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:12,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:12,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:12,574 INFO L87 Difference]: Start difference. First operand 107 states and 173 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:13,480 INFO L93 Difference]: Finished difference Result 137 states and 213 transitions. [2022-11-02 20:48:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:13,482 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:48:13,482 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:48:13,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:13,483 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:13,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:48:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2022-11-02 20:48:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.6310679611650485) internal successors, (168), 104 states have internal predecessors, (168), 0 states have call successors, (0), 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 20:48:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 168 transitions. [2022-11-02 20:48:13,487 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 168 transitions. Word has length 16 [2022-11-02 20:48:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:13,487 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 168 transitions. [2022-11-02 20:48:13,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2022-11-02 20:48:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:13,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:13,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:13,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-02 20:48:13,488 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1512619890, now seen corresponding path program 7 times [2022-11-02 20:48:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:13,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441674333] [2022-11-02 20:48:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:13,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:14,368 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 20:48:14,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:14,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441674333] [2022-11-02 20:48:14,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441674333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:14,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:14,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753156727] [2022-11-02 20:48:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:14,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:14,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:14,370 INFO L87 Difference]: Start difference. First operand 105 states and 168 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:15,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:15,354 INFO L93 Difference]: Finished difference Result 141 states and 215 transitions. [2022-11-02 20:48:15,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:15,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:15,355 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:48:15,355 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 20:48:15,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:15,356 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 58 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:15,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:48:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 20:48:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2022-11-02 20:48:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 92 states have internal predecessors, (150), 0 states have call successors, (0), 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 20:48:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 150 transitions. [2022-11-02 20:48:15,360 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 150 transitions. Word has length 16 [2022-11-02 20:48:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:15,360 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 150 transitions. [2022-11-02 20:48:15,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 150 transitions. [2022-11-02 20:48:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:15,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:15,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:15,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-02 20:48:15,362 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 20:48:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1512619823, now seen corresponding path program 11 times [2022-11-02 20:48:15,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:15,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126467021] [2022-11-02 20:48:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,943 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 20:48:15,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:15,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126467021] [2022-11-02 20:48:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126467021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:15,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133123051] [2022-11-02 20:48:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:15,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:15,945 INFO L87 Difference]: Start difference. First operand 93 states and 150 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:16,759 INFO L93 Difference]: Finished difference Result 152 states and 234 transitions. [2022-11-02 20:48:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:16,761 INFO L225 Difference]: With dead ends: 152 [2022-11-02 20:48:16,761 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:48:16,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:16,762 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 97 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:16,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 3 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:48:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 90. [2022-11-02 20:48:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.6363636363636365) internal successors, (144), 89 states have internal predecessors, (144), 0 states have call successors, (0), 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 20:48:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 144 transitions. [2022-11-02 20:48:16,765 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 144 transitions. Word has length 16 [2022-11-02 20:48:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:16,765 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 144 transitions. [2022-11-02 20:48:16,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 144 transitions. [2022-11-02 20:48:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:16,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:16,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:16,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-02 20:48:16,766 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2053525006, now seen corresponding path program 8 times [2022-11-02 20:48:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:16,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601204805] [2022-11-02 20:48:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:17,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 20:48:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:17,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601204805] [2022-11-02 20:48:17,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601204805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:17,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:17,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759264311] [2022-11-02 20:48:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:17,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:17,760 INFO L87 Difference]: Start difference. First operand 90 states and 144 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:18,468 INFO L93 Difference]: Finished difference Result 114 states and 177 transitions. [2022-11-02 20:48:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:18,469 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:18,470 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:48:18,470 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:48:18,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:18,471 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:18,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:48:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2022-11-02 20:48:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.6363636363636365) internal successors, (144), 89 states have internal predecessors, (144), 0 states have call successors, (0), 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 20:48:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 144 transitions. [2022-11-02 20:48:18,474 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 144 transitions. Word has length 16 [2022-11-02 20:48:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 144 transitions. [2022-11-02 20:48:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 144 transitions. [2022-11-02 20:48:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:18,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:18,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:18,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-02 20:48:18,476 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 20:48:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2053525073, now seen corresponding path program 12 times [2022-11-02 20:48:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:18,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546958037] [2022-11-02 20:48:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:19,099 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 20:48:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:19,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546958037] [2022-11-02 20:48:19,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546958037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:19,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:19,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:19,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853526468] [2022-11-02 20:48:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:19,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:19,100 INFO L87 Difference]: Start difference. First operand 90 states and 144 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:19,712 INFO L93 Difference]: Finished difference Result 137 states and 212 transitions. [2022-11-02 20:48:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:19,714 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:48:19,714 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:48:19,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:48:19,714 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 100 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:19,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 3 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:48:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2022-11-02 20:48:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.625) internal successors, (130), 81 states have internal predecessors, (130), 0 states have call successors, (0), 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 20:48:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 130 transitions. [2022-11-02 20:48:19,717 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 130 transitions. Word has length 16 [2022-11-02 20:48:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:19,718 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 130 transitions. [2022-11-02 20:48:19,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 130 transitions. [2022-11-02 20:48:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:19,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:19,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:19,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-02 20:48:19,719 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash -139558222, now seen corresponding path program 9 times [2022-11-02 20:48:19,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:19,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830880265] [2022-11-02 20:48:19,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:19,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:20,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 20:48:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830880265] [2022-11-02 20:48:20,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830880265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:20,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:20,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025879697] [2022-11-02 20:48:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:20,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:20,670 INFO L87 Difference]: Start difference. First operand 82 states and 130 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:21,432 INFO L93 Difference]: Finished difference Result 108 states and 164 transitions. [2022-11-02 20:48:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:21,434 INFO L225 Difference]: With dead ends: 108 [2022-11-02 20:48:21,434 INFO L226 Difference]: Without dead ends: 108 [2022-11-02 20:48:21,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:21,435 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:21,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-02 20:48:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2022-11-02 20:48:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.6046511627906976) internal successors, (138), 87 states have internal predecessors, (138), 0 states have call successors, (0), 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 20:48:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2022-11-02 20:48:21,439 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 16 [2022-11-02 20:48:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:21,440 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2022-11-02 20:48:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2022-11-02 20:48:21,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:21,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:21,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-02 20:48:21,441 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 20:48:21,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -139558155, now seen corresponding path program 13 times [2022-11-02 20:48:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543923245] [2022-11-02 20:48:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:22,010 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 20:48:22,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:22,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543923245] [2022-11-02 20:48:22,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543923245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:22,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:22,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406874193] [2022-11-02 20:48:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:22,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:22,012 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:22,776 INFO L93 Difference]: Finished difference Result 131 states and 199 transitions. [2022-11-02 20:48:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:22,776 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:22,777 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:48:22,777 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:48:22,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:22,778 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 94 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:22,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 7 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:48:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2022-11-02 20:48:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.5930232558139534) internal successors, (137), 87 states have internal predecessors, (137), 0 states have call successors, (0), 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 20:48:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2022-11-02 20:48:22,781 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 16 [2022-11-02 20:48:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:22,782 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2022-11-02 20:48:22,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2022-11-02 20:48:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:22,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:22,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:22,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-02 20:48:22,783 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 20:48:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash -137696362, now seen corresponding path program 10 times [2022-11-02 20:48:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:22,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645726860] [2022-11-02 20:48:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:22,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:23,632 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 20:48:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:23,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645726860] [2022-11-02 20:48:23,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645726860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:23,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:23,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430585781] [2022-11-02 20:48:23,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:23,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:23,634 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:24,275 INFO L93 Difference]: Finished difference Result 98 states and 150 transitions. [2022-11-02 20:48:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:24,277 INFO L225 Difference]: With dead ends: 98 [2022-11-02 20:48:24,277 INFO L226 Difference]: Without dead ends: 98 [2022-11-02 20:48:24,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:24,277 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 31 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:24,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-02 20:48:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2022-11-02 20:48:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.5930232558139534) internal successors, (137), 87 states have internal predecessors, (137), 0 states have call successors, (0), 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 20:48:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 137 transitions. [2022-11-02 20:48:24,279 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 137 transitions. Word has length 16 [2022-11-02 20:48:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:24,279 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 137 transitions. [2022-11-02 20:48:24,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 137 transitions. [2022-11-02 20:48:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:24,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:24,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:24,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-02 20:48:24,280 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 20:48:24,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -137696295, now seen corresponding path program 14 times [2022-11-02 20:48:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:24,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551210098] [2022-11-02 20:48:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:25,171 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 20:48:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:25,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551210098] [2022-11-02 20:48:25,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551210098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:25,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:25,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637717600] [2022-11-02 20:48:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:25,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:25,173 INFO L87 Difference]: Start difference. First operand 88 states and 137 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:25,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:25,745 INFO L93 Difference]: Finished difference Result 102 states and 156 transitions. [2022-11-02 20:48:25,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:25,746 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:48:25,746 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:48:25,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:48:25,747 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:25,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:25,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:48:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-02 20:48:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.618421052631579) internal successors, (123), 77 states have internal predecessors, (123), 0 states have call successors, (0), 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 20:48:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2022-11-02 20:48:25,750 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 16 [2022-11-02 20:48:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:25,751 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2022-11-02 20:48:25,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2022-11-02 20:48:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:25,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:25,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:25,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-02 20:48:25,752 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 20:48:25,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1994674102, now seen corresponding path program 11 times [2022-11-02 20:48:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:25,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965529339] [2022-11-02 20:48:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:25,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:26,501 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 20:48:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:26,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965529339] [2022-11-02 20:48:26,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965529339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:26,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:26,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:26,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485535354] [2022-11-02 20:48:26,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:26,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:26,503 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:27,202 INFO L93 Difference]: Finished difference Result 104 states and 157 transitions. [2022-11-02 20:48:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:27,203 INFO L225 Difference]: With dead ends: 104 [2022-11-02 20:48:27,203 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:48:27,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:27,204 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:27,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:48:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2022-11-02 20:48:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 83 states have internal predecessors, (131), 0 states have call successors, (0), 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 20:48:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2022-11-02 20:48:27,208 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 16 [2022-11-02 20:48:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:27,208 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2022-11-02 20:48:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2022-11-02 20:48:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:27,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:27,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:27,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-02 20:48:27,210 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 20:48:27,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1994674035, now seen corresponding path program 15 times [2022-11-02 20:48:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:27,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276000941] [2022-11-02 20:48:27,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:27,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:27,803 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 20:48:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:27,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276000941] [2022-11-02 20:48:27,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276000941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:27,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:27,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972129946] [2022-11-02 20:48:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:27,806 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:28,479 INFO L93 Difference]: Finished difference Result 102 states and 154 transitions. [2022-11-02 20:48:28,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:28,480 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:48:28,480 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:48:28,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:48:28,481 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 70 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:28,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 5 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:48:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-02 20:48:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 83 states have internal predecessors, (130), 0 states have call successors, (0), 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 20:48:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2022-11-02 20:48:28,484 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 16 [2022-11-02 20:48:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:28,484 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2022-11-02 20:48:28,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2022-11-02 20:48:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:28,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:28,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:28,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-02 20:48:28,485 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 20:48:28,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1992812242, now seen corresponding path program 12 times [2022-11-02 20:48:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:28,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366087209] [2022-11-02 20:48:28,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:28,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:29,521 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 20:48:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:29,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366087209] [2022-11-02 20:48:29,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366087209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:29,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:29,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200406922] [2022-11-02 20:48:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:29,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:29,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:29,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:29,522 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:30,125 INFO L93 Difference]: Finished difference Result 94 states and 143 transitions. [2022-11-02 20:48:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:30,126 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:48:30,126 INFO L226 Difference]: Without dead ends: 94 [2022-11-02 20:48:30,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:30,126 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 34 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:30,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-02 20:48:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-11-02 20:48:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 83 states have internal predecessors, (130), 0 states have call successors, (0), 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 20:48:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2022-11-02 20:48:30,129 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 16 [2022-11-02 20:48:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:30,130 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2022-11-02 20:48:30,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2022-11-02 20:48:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:30,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:30,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:30,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-02 20:48:30,131 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 20:48:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1992812175, now seen corresponding path program 16 times [2022-11-02 20:48:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101804501] [2022-11-02 20:48:30,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,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 20:48:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:30,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101804501] [2022-11-02 20:48:30,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101804501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:30,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:30,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:30,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331821713] [2022-11-02 20:48:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:30,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:30,708 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:31,308 INFO L93 Difference]: Finished difference Result 92 states and 140 transitions. [2022-11-02 20:48:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:31,309 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:48:31,309 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:48:31,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:31,309 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 71 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:31,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 6 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:48:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-02 20:48:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 76 states have internal predecessors, (121), 0 states have call successors, (0), 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 20:48:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2022-11-02 20:48:31,312 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 16 [2022-11-02 20:48:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:31,313 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2022-11-02 20:48:31,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2022-11-02 20:48:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:31,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:31,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-02 20:48:31,314 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -559660136, now seen corresponding path program 13 times [2022-11-02 20:48:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:31,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268263291] [2022-11-02 20:48:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:32,343 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 20:48:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:32,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268263291] [2022-11-02 20:48:32,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268263291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:32,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:32,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144309910] [2022-11-02 20:48:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:32,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:32,345 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:33,043 INFO L93 Difference]: Finished difference Result 103 states and 155 transitions. [2022-11-02 20:48:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:33,043 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:33,044 INFO L225 Difference]: With dead ends: 103 [2022-11-02 20:48:33,044 INFO L226 Difference]: Without dead ends: 103 [2022-11-02 20:48:33,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:33,045 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:33,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-02 20:48:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-11-02 20:48:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.6) internal successors, (128), 81 states have internal predecessors, (128), 0 states have call successors, (0), 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 20:48:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2022-11-02 20:48:33,048 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 16 [2022-11-02 20:48:33,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:33,048 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2022-11-02 20:48:33,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2022-11-02 20:48:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:33,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:33,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:33,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-02 20:48:33,049 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 20:48:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash -559660069, now seen corresponding path program 17 times [2022-11-02 20:48:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:33,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507640379] [2022-11-02 20:48:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:33,671 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 20:48:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507640379] [2022-11-02 20:48:33,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507640379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:33,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:33,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744414470] [2022-11-02 20:48:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:33,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:33,673 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:34,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:34,516 INFO L93 Difference]: Finished difference Result 137 states and 205 transitions. [2022-11-02 20:48:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:48:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:34,518 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:48:34,518 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:48:34,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:48:34,519 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:34,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:48:34,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 96. [2022-11-02 20:48:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 95 states have internal predecessors, (150), 0 states have call successors, (0), 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 20:48:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2022-11-02 20:48:34,522 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 16 [2022-11-02 20:48:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:34,522 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2022-11-02 20:48:34,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2022-11-02 20:48:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:34,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:34,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:34,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-02 20:48:34,523 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash -557798276, now seen corresponding path program 14 times [2022-11-02 20:48:34,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:34,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617959499] [2022-11-02 20:48:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:35,365 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 20:48:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:35,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617959499] [2022-11-02 20:48:35,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617959499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:35,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:35,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:35,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017289699] [2022-11-02 20:48:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:35,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:35,367 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:36,045 INFO L93 Difference]: Finished difference Result 106 states and 163 transitions. [2022-11-02 20:48:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:36,047 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:48:36,047 INFO L226 Difference]: Without dead ends: 106 [2022-11-02 20:48:36,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:36,047 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:36,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-02 20:48:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2022-11-02 20:48:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.5957446808510638) internal successors, (150), 95 states have internal predecessors, (150), 0 states have call successors, (0), 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 20:48:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2022-11-02 20:48:36,050 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 16 [2022-11-02 20:48:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:36,051 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2022-11-02 20:48:36,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2022-11-02 20:48:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:36,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:36,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:36,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-02 20:48:36,051 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 20:48:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:36,052 INFO L85 PathProgramCache]: Analyzing trace with hash -557798209, now seen corresponding path program 18 times [2022-11-02 20:48:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:36,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610854458] [2022-11-02 20:48:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:36,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:36,679 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 20:48:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:36,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610854458] [2022-11-02 20:48:36,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610854458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:36,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:36,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342365672] [2022-11-02 20:48:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:36,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:36,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:36,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:36,681 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:37,424 INFO L93 Difference]: Finished difference Result 156 states and 233 transitions. [2022-11-02 20:48:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:37,424 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:37,425 INFO L225 Difference]: With dead ends: 156 [2022-11-02 20:48:37,425 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:48:37,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:37,426 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:37,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:48:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2022-11-02 20:48:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.6041666666666667) internal successors, (154), 97 states have internal predecessors, (154), 0 states have call successors, (0), 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 20:48:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 154 transitions. [2022-11-02 20:48:37,430 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 154 transitions. Word has length 16 [2022-11-02 20:48:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:37,430 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 154 transitions. [2022-11-02 20:48:37,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 154 transitions. [2022-11-02 20:48:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:37,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:37,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:37,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-02 20:48:37,432 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1856663142, now seen corresponding path program 15 times [2022-11-02 20:48:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:37,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942136749] [2022-11-02 20:48:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:38,459 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 20:48:38,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:38,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942136749] [2022-11-02 20:48:38,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942136749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:38,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:38,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904560333] [2022-11-02 20:48:38,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:38,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:38,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:38,461 INFO L87 Difference]: Start difference. First operand 98 states and 154 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:39,347 INFO L93 Difference]: Finished difference Result 125 states and 191 transitions. [2022-11-02 20:48:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:39,347 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:39,348 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:48:39,348 INFO L226 Difference]: Without dead ends: 119 [2022-11-02 20:48:39,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:39,349 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:39,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:39,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-02 20:48:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2022-11-02 20:48:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 95 states have internal predecessors, (149), 0 states have call successors, (0), 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 20:48:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 149 transitions. [2022-11-02 20:48:39,351 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 149 transitions. Word has length 16 [2022-11-02 20:48:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:39,351 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 149 transitions. [2022-11-02 20:48:39,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2022-11-02 20:48:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:39,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:39,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:39,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-02 20:48:39,352 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1858525002, now seen corresponding path program 16 times [2022-11-02 20:48:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:39,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542718073] [2022-11-02 20:48:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:40,206 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 20:48:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:40,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542718073] [2022-11-02 20:48:40,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542718073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:40,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:40,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:40,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191566246] [2022-11-02 20:48:40,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:40,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:40,208 INFO L87 Difference]: Start difference. First operand 96 states and 149 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:41,096 INFO L93 Difference]: Finished difference Result 129 states and 193 transitions. [2022-11-02 20:48:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:48:41,097 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:41,097 INFO L225 Difference]: With dead ends: 129 [2022-11-02 20:48:41,097 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:48:41,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:48:41,098 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:41,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:48:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 84. [2022-11-02 20:48:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 83 states have internal predecessors, (131), 0 states have call successors, (0), 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 20:48:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2022-11-02 20:48:41,101 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 16 [2022-11-02 20:48:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:41,101 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2022-11-02 20:48:41,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2022-11-02 20:48:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:41,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:41,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:41,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-02 20:48:41,102 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 20:48:41,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1858525069, now seen corresponding path program 19 times [2022-11-02 20:48:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:41,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697948277] [2022-11-02 20:48:41,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:41,783 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 20:48:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:41,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697948277] [2022-11-02 20:48:41,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697948277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:41,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:41,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763223581] [2022-11-02 20:48:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:41,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:41,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:41,784 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:42,573 INFO L93 Difference]: Finished difference Result 125 states and 187 transitions. [2022-11-02 20:48:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:42,574 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:42,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:42,574 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:48:42,574 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:48:42,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:42,575 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 78 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:42,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 3 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:48:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2022-11-02 20:48:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 80 states have internal predecessors, (125), 0 states have call successors, (0), 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 20:48:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2022-11-02 20:48:42,577 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 16 [2022-11-02 20:48:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:42,577 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2022-11-02 20:48:42,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2022-11-02 20:48:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:42,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:42,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:42,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-02 20:48:42,578 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1129702602, now seen corresponding path program 17 times [2022-11-02 20:48:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:42,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011625434] [2022-11-02 20:48:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:43,391 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 20:48:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:43,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011625434] [2022-11-02 20:48:43,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011625434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:43,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:43,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309650972] [2022-11-02 20:48:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:43,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:43,393 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:43,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:43,979 INFO L93 Difference]: Finished difference Result 102 states and 155 transitions. [2022-11-02 20:48:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:43,979 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:43,980 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:48:43,980 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:48:43,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:43,980 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:43,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:48:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2022-11-02 20:48:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 80 states have internal predecessors, (125), 0 states have call successors, (0), 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 20:48:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2022-11-02 20:48:43,982 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 16 [2022-11-02 20:48:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:43,982 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2022-11-02 20:48:43,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2022-11-02 20:48:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:43,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:43,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:43,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-02 20:48:43,983 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:43,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1129702669, now seen corresponding path program 20 times [2022-11-02 20:48:43,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:43,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082281123] [2022-11-02 20:48:43,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:43,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:44,563 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 20:48:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:44,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082281123] [2022-11-02 20:48:44,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082281123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:44,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:44,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:44,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964222287] [2022-11-02 20:48:44,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:44,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:44,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:44,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:44,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:44,565 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:45,198 INFO L93 Difference]: Finished difference Result 110 states and 165 transitions. [2022-11-02 20:48:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:45,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:45,200 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:48:45,200 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:48:45,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:48:45,200 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:45,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:48:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-11-02 20:48:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 72 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 20:48:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2022-11-02 20:48:45,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 16 [2022-11-02 20:48:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:45,204 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2022-11-02 20:48:45,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2022-11-02 20:48:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:45,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:45,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:45,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-02 20:48:45,205 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1063380626, now seen corresponding path program 18 times [2022-11-02 20:48:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:45,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943599122] [2022-11-02 20:48:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:45,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:46,004 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 20:48:46,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:46,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943599122] [2022-11-02 20:48:46,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943599122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:46,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:46,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061289931] [2022-11-02 20:48:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:46,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:46,006 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:46,681 INFO L93 Difference]: Finished difference Result 96 states and 142 transitions. [2022-11-02 20:48:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:48:46,681 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:46,682 INFO L225 Difference]: With dead ends: 96 [2022-11-02 20:48:46,682 INFO L226 Difference]: Without dead ends: 96 [2022-11-02 20:48:46,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:46,683 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 21 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:46,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:48:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-02 20:48:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 76. [2022-11-02 20:48:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 75 states have internal predecessors, (116), 0 states have call successors, (0), 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 20:48:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2022-11-02 20:48:46,686 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 16 [2022-11-02 20:48:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:46,686 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2022-11-02 20:48:46,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2022-11-02 20:48:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:46,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:46,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:46,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-02 20:48:46,687 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:46,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1063380559, now seen corresponding path program 21 times [2022-11-02 20:48:46,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:46,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167551497] [2022-11-02 20:48:46,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,330 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 20:48:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:47,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167551497] [2022-11-02 20:48:47,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167551497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632838849] [2022-11-02 20:48:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:47,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:47,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:47,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:47,332 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:47,866 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2022-11-02 20:48:47,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:47,866 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:47,867 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:48:47,867 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:48:47,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:48:47,867 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 63 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:47,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 5 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:48:47,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 76. [2022-11-02 20:48:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.554054054054054) internal successors, (115), 75 states have internal predecessors, (115), 0 states have call successors, (0), 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 20:48:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2022-11-02 20:48:47,870 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 16 [2022-11-02 20:48:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:47,871 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2022-11-02 20:48:47,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2022-11-02 20:48:47,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:47,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:47,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:47,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-02 20:48:47,872 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1061518766, now seen corresponding path program 19 times [2022-11-02 20:48:47,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:47,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352379182] [2022-11-02 20:48:47,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:47,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:48,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352379182] [2022-11-02 20:48:48,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352379182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:48,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:48,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900891467] [2022-11-02 20:48:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:48,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:48,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:48,710 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:49,291 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2022-11-02 20:48:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:49,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:49,292 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:48:49,292 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:48:49,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:49,293 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:49,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:49,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:48:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2022-11-02 20:48:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.554054054054054) internal successors, (115), 75 states have internal predecessors, (115), 0 states have call successors, (0), 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 20:48:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2022-11-02 20:48:49,298 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 16 [2022-11-02 20:48:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:49,299 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2022-11-02 20:48:49,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2022-11-02 20:48:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:49,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:49,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:49,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-02 20:48:49,300 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1061518699, now seen corresponding path program 22 times [2022-11-02 20:48:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:49,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868657300] [2022-11-02 20:48:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:49,991 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 20:48:49,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:49,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868657300] [2022-11-02 20:48:49,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868657300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:49,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:49,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:48:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484825802] [2022-11-02 20:48:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:49,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:48:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:48:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:48:49,993 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:50,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:50,509 INFO L93 Difference]: Finished difference Result 84 states and 125 transitions. [2022-11-02 20:48:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:50,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:50,510 INFO L225 Difference]: With dead ends: 84 [2022-11-02 20:48:50,511 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:48:50,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:50,511 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:50,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 6 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:48:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-02 20:48:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.6031746031746033) internal successors, (101), 64 states have internal predecessors, (101), 0 states have call successors, (0), 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 20:48:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2022-11-02 20:48:50,514 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 16 [2022-11-02 20:48:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:50,514 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2022-11-02 20:48:50,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2022-11-02 20:48:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:50,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:50,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:50,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-02 20:48:50,515 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 20:48:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1983393759, now seen corresponding path program 23 times [2022-11-02 20:48:50,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021602490] [2022-11-02 20:48:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:51,264 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 20:48:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021602490] [2022-11-02 20:48:51,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021602490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:51,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:51,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:48:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915891451] [2022-11-02 20:48:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:51,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:48:51,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:51,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:48:51,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:48:51,266 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:51,989 INFO L93 Difference]: Finished difference Result 98 states and 147 transitions. [2022-11-02 20:48:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:51,990 INFO L225 Difference]: With dead ends: 98 [2022-11-02 20:48:51,990 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 20:48:51,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:48:51,991 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:51,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 20:48:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2022-11-02 20:48:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.6081081081081081) internal successors, (119), 75 states have internal predecessors, (119), 0 states have call successors, (0), 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 20:48:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2022-11-02 20:48:51,993 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 16 [2022-11-02 20:48:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:51,993 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2022-11-02 20:48:51,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2022-11-02 20:48:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:51,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:51,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:51,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-02 20:48:51,994 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1985255619, now seen corresponding path program 24 times [2022-11-02 20:48:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:51,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760062475] [2022-11-02 20:48:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:52,450 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 20:48:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:52,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760062475] [2022-11-02 20:48:52,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760062475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:52,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:52,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447976029] [2022-11-02 20:48:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:52,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:52,451 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:52,879 INFO L93 Difference]: Finished difference Result 98 states and 148 transitions. [2022-11-02 20:48:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:48:52,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:52,880 INFO L225 Difference]: With dead ends: 98 [2022-11-02 20:48:52,880 INFO L226 Difference]: Without dead ends: 87 [2022-11-02 20:48:52,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:48:52,880 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 78 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:52,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-02 20:48:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 73. [2022-11-02 20:48:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.591549295774648) internal successors, (113), 72 states have internal predecessors, (113), 0 states have call successors, (0), 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 20:48:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2022-11-02 20:48:52,883 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 16 [2022-11-02 20:48:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:52,883 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2022-11-02 20:48:52,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2022-11-02 20:48:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:52,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:52,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:52,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-02 20:48:52,884 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:52,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:52,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1256433219, now seen corresponding path program 25 times [2022-11-02 20:48:52,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:52,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053933496] [2022-11-02 20:48:52,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:53,367 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 20:48:53,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:53,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053933496] [2022-11-02 20:48:53,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053933496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:53,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:53,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744604953] [2022-11-02 20:48:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:53,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:53,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:53,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:53,368 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:53,666 INFO L93 Difference]: Finished difference Result 85 states and 129 transitions. [2022-11-02 20:48:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:48:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:53,667 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:48:53,667 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:48:53,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:48:53,668 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 83 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:53,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:48:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-02 20:48:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 66 states have internal predecessors, (103), 0 states have call successors, (0), 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 20:48:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2022-11-02 20:48:53,670 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 16 [2022-11-02 20:48:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:53,670 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2022-11-02 20:48:53,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2022-11-02 20:48:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:53,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:53,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:53,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-02 20:48:53,671 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:53,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash -14822497, now seen corresponding path program 26 times [2022-11-02 20:48:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:53,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720461448] [2022-11-02 20:48:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:54,098 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 20:48:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:54,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720461448] [2022-11-02 20:48:54,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720461448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:54,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:54,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910751740] [2022-11-02 20:48:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:54,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:54,100 INFO L87 Difference]: Start difference. First operand 67 states and 103 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:54,586 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2022-11-02 20:48:54,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:48:54,587 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:54,587 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:48:54,587 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:48:54,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:48:54,588 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:54,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:48:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2022-11-02 20:48:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 69 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 20:48:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2022-11-02 20:48:54,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 16 [2022-11-02 20:48:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:54,590 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2022-11-02 20:48:54,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2022-11-02 20:48:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:54,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:54,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:54,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-02 20:48:54,591 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:54,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash -12960637, now seen corresponding path program 27 times [2022-11-02 20:48:54,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:54,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879514515] [2022-11-02 20:48:54,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:54,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:55,267 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 20:48:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879514515] [2022-11-02 20:48:55,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879514515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:55,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:55,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:48:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746856017] [2022-11-02 20:48:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:55,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:48:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:48:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:48:55,269 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:56,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:56,085 INFO L93 Difference]: Finished difference Result 88 states and 130 transitions. [2022-11-02 20:48:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:56,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:56,086 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:48:56,086 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:48:56,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:48:56,087 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:56,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:48:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:48:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-11-02 20:48:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 66 states have internal predecessors, (101), 0 states have call successors, (0), 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 20:48:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2022-11-02 20:48:56,089 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 16 [2022-11-02 20:48:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:56,089 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2022-11-02 20:48:56,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2022-11-02 20:48:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:56,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:56,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-02 20:48:56,091 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -741783037, now seen corresponding path program 28 times [2022-11-02 20:48:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:56,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243703150] [2022-11-02 20:48:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:56,532 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 20:48:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:56,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243703150] [2022-11-02 20:48:56,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243703150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:56,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:56,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:56,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527317033] [2022-11-02 20:48:56,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:56,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:56,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:56,533 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:56,930 INFO L93 Difference]: Finished difference Result 75 states and 111 transitions. [2022-11-02 20:48:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:48:56,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:56,931 INFO L225 Difference]: With dead ends: 75 [2022-11-02 20:48:56,931 INFO L226 Difference]: Without dead ends: 59 [2022-11-02 20:48:56,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:48:56,932 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:56,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-02 20:48:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-02 20:48:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 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 20:48:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2022-11-02 20:48:56,934 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 16 [2022-11-02 20:48:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:56,934 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2022-11-02 20:48:56,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2022-11-02 20:48:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:56,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:56,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:56,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-02 20:48:56,936 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2120875395, now seen corresponding path program 29 times [2022-11-02 20:48:56,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:56,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440612349] [2022-11-02 20:48:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:57,388 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 20:48:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:57,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440612349] [2022-11-02 20:48:57,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440612349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:57,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:57,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804269963] [2022-11-02 20:48:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:57,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:57,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:57,390 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:57,811 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-11-02 20:48:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:48:57,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:57,819 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:48:57,819 INFO L226 Difference]: Without dead ends: 59 [2022-11-02 20:48:57,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:48:57,820 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:57,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 2 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-02 20:48:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2022-11-02 20:48:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.509090909090909) internal successors, (83), 56 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 20:48:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2022-11-02 20:48:57,822 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 16 [2022-11-02 20:48:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:57,823 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2022-11-02 20:48:57,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-11-02 20:48:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:57,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:57,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:57,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-02 20:48:57,824 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:57,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2119013535, now seen corresponding path program 30 times [2022-11-02 20:48:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:57,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767685443] [2022-11-02 20:48:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:58,316 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 20:48:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:58,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767685443] [2022-11-02 20:48:58,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767685443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:58,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:58,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:48:58,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893086075] [2022-11-02 20:48:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:58,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:48:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:58,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:48:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:48:58,318 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:58,734 INFO L93 Difference]: Finished difference Result 57 states and 81 transitions. [2022-11-02 20:48:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:48:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:48:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:58,735 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:48:58,735 INFO L226 Difference]: Without dead ends: 39 [2022-11-02 20:48:58,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:48:58,736 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:58,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:48:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-02 20:48:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-02 20:48:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 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 20:48:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2022-11-02 20:48:58,738 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 16 [2022-11-02 20:48:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:58,738 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2022-11-02 20:48:58,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:48:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2022-11-02 20:48:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:58,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:58,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-02 20:48:58,739 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:48:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:58,739 INFO L85 PathProgramCache]: Analyzing trace with hash -356855826, now seen corresponding path program 20 times [2022-11-02 20:48:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:58,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943709743] [2022-11-02 20:48:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:59,602 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 20:48:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:59,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943709743] [2022-11-02 20:48:59,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943709743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:59,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:59,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:48:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958696251] [2022-11-02 20:48:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:59,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:48:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:48:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:48:59,603 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:00,268 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-11-02 20:49:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:49:00,269 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:00,269 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:49:00,269 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:49:00,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:49:00,270 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:00,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:49:00,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-02 20:49:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 0 states have call successors, (0), 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 20:49:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-11-02 20:49:00,272 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 16 [2022-11-02 20:49:00,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:00,272 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-11-02 20:49:00,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-11-02 20:49:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:49:00,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:00,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:00,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-11-02 20:49:00,273 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:49:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -354993966, now seen corresponding path program 21 times [2022-11-02 20:49:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:00,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736361445] [2022-11-02 20:49:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:01,100 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 20:49:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:01,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736361445] [2022-11-02 20:49:01,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736361445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:01,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:01,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:49:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675497229] [2022-11-02 20:49:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:01,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:49:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:49:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:49:01,102 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:01,787 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-11-02 20:49:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:49:01,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:01,788 INFO L225 Difference]: With dead ends: 43 [2022-11-02 20:49:01,788 INFO L226 Difference]: Without dead ends: 43 [2022-11-02 20:49:01,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:49:01,789 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:01,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:49:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-02 20:49:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-11-02 20:49:01,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 40 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 20:49:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2022-11-02 20:49:01,790 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 16 [2022-11-02 20:49:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:01,790 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2022-11-02 20:49:01,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2022-11-02 20:49:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:49:01,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:01,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:01,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-11-02 20:49:01,791 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:49:01,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:01,791 INFO L85 PathProgramCache]: Analyzing trace with hash -354993899, now seen corresponding path program 31 times [2022-11-02 20:49:01,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:01,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085404623] [2022-11-02 20:49:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:01,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:02,461 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 20:49:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:02,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085404623] [2022-11-02 20:49:02,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085404623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:02,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:02,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:49:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267828308] [2022-11-02 20:49:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:02,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:49:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:49:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:49:02,462 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:03,149 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-11-02 20:49:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:49:03,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:03,150 INFO L225 Difference]: With dead ends: 41 [2022-11-02 20:49:03,150 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 20:49:03,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:49:03,150 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 91 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:03,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 20:49:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-02 20:49:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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 20:49:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-11-02 20:49:03,151 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 16 [2022-11-02 20:49:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:03,152 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-11-02 20:49:03,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-11-02 20:49:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:49:03,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:03,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:03,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-11-02 20:49:03,152 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:49:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1083816366, now seen corresponding path program 22 times [2022-11-02 20:49:03,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:03,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652952914] [2022-11-02 20:49:03,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:03,957 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 20:49:03,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:03,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652952914] [2022-11-02 20:49:03,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652952914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:03,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:03,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:49:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213787146] [2022-11-02 20:49:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:03,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:49:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:49:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:49:03,959 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:04,456 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-11-02 20:49:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:49:04,457 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:04,457 INFO L225 Difference]: With dead ends: 28 [2022-11-02 20:49:04,457 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:49:04,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:49:04,458 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:04,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:49:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:49:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-02 20:49:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 0 states have call successors, (0), 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 20:49:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-11-02 20:49:04,459 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 16 [2022-11-02 20:49:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:04,459 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-02 20:49:04,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-11-02 20:49:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:49:04,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:04,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:04,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-11-02 20:49:04,460 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2022-11-02 20:49:04,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1083816299, now seen corresponding path program 32 times [2022-11-02 20:49:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424296180] [2022-11-02 20:49:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:04,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:05,134 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 20:49:05,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:05,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424296180] [2022-11-02 20:49:05,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424296180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:05,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:05,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:49:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278702613] [2022-11-02 20:49:05,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:05,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:49:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:49:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:49:05,136 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:05,616 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-11-02 20:49:05,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:49:05,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:49:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:05,616 INFO L225 Difference]: With dead ends: 26 [2022-11-02 20:49:05,616 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:49:05,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:49:05,617 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:05,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:49:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:49:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:49:05,618 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 20:49:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:49:05,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-11-02 20:49:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:05,618 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:49:05,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:49:05,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:49:05,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:49:05,621 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2022-11-02 20:49:05,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2022-11-02 20:49:05,631 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-02 20:49:05,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-02 20:49:05,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-02 20:49:05,632 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-02 20:49:05,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-02 20:49:05,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-02 20:49:05,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-11-02 20:49:05,637 INFO L444 BasicCegarLoop]: Path program histogram: [32, 22, 7, 7, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:05,641 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:49:05,642 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:49:05,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:49:05 BasicIcfg [2022-11-02 20:49:05,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:49:05,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:49:05,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:49:05,649 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:49:05,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:45:44" (3/4) ... [2022-11-02 20:49:05,652 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:49:05,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2022-11-02 20:49:05,667 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2022-11-02 20:49:05,667 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:49:05,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:49:05,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:49:05,699 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:49:05,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:49:05,700 INFO L158 Benchmark]: Toolchain (without parser) took 202926.65ms. Allocated memory was 98.6MB in the beginning and 461.4MB in the end (delta: 362.8MB). Free memory was 70.9MB in the beginning and 235.8MB in the end (delta: -164.9MB). Peak memory consumption was 196.5MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,700 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 69.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:49:05,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1143.61ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 70.7MB in the beginning and 84.9MB in the end (delta: -14.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.52ms. Allocated memory is still 123.7MB. Free memory was 84.9MB in the beginning and 81.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,701 INFO L158 Benchmark]: Boogie Preprocessor took 58.00ms. Allocated memory is still 123.7MB. Free memory was 81.8MB in the beginning and 78.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,701 INFO L158 Benchmark]: RCFGBuilder took 845.39ms. Allocated memory is still 123.7MB. Free memory was 78.6MB in the beginning and 89.2MB in the end (delta: -10.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,702 INFO L158 Benchmark]: TraceAbstraction took 200757.30ms. Allocated memory was 123.7MB in the beginning and 461.4MB in the end (delta: 337.6MB). Free memory was 88.6MB in the beginning and 240.0MB in the end (delta: -151.4MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,702 INFO L158 Benchmark]: Witness Printer took 51.33ms. Allocated memory is still 461.4MB. Free memory was 240.0MB in the beginning and 235.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:49:05,703 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.32ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 69.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1143.61ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 70.7MB in the beginning and 84.9MB in the end (delta: -14.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.52ms. Allocated memory is still 123.7MB. Free memory was 84.9MB in the beginning and 81.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.00ms. Allocated memory is still 123.7MB. Free memory was 81.8MB in the beginning and 78.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 845.39ms. Allocated memory is still 123.7MB. Free memory was 78.6MB in the beginning and 89.2MB in the end (delta: -10.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 200757.30ms. Allocated memory was 123.7MB in the beginning and 461.4MB in the end (delta: 337.6MB). Free memory was 88.6MB in the beginning and 240.0MB in the end (delta: -151.4MB). Peak memory consumption was 186.1MB. Max. memory is 16.1GB. * Witness Printer took 51.33ms. Allocated memory is still 461.4MB. Free memory was 240.0MB in the beginning and 235.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.3s, 195 PlacesBefore, 37 PlacesAfterwards, 197 TransitionsBefore, 34 TransitionsAfterwards, 4500 CoEnabledTransitionPairs, 9 FixpointIterations, 100 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 26 ConcurrentYvCompositions, 5 ChoiceCompositions, 214 TotalNumberOfCompositions, 9878 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4919, positive: 4593, positive conditional: 0, positive unconditional: 4593, negative: 326, negative conditional: 0, negative unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3200, positive: 3133, positive conditional: 0, positive unconditional: 3133, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3200, positive: 3118, positive conditional: 0, positive unconditional: 3118, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70368, positive: 232, positive conditional: 0, positive unconditional: 232, negative: 547, negative conditional: 0, negative unconditional: 547, unknown: 69589, unknown conditional: 0, unknown unconditional: 69589] ], Cache Queries: [ total: 4919, positive: 1460, positive conditional: 0, positive unconditional: 1460, negative: 259, negative conditional: 0, negative unconditional: 259, unknown: 3200, unknown conditional: 0, unknown unconditional: 3200] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - 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: 1712]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1712]: 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, 210 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 200.5s, OverallIterations: 81, TraceHistogramMax: 1, PathProgramHistogramMax: 32, EmptinessCheckTime: 0.1s, AutomataDifference: 49.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 90.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5018 SdHoareTripleChecker+Valid, 24.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5018 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2894 mSDsCounter, 2213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17996 IncrementalHoareTripleChecker+Invalid, 20209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2213 mSolverCounterUnsat, 92 mSDtfsCounter, 17996 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1455 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=456occurred in iteration=0, InterpolantAutomatonStates: 975, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 81 MinimizatonAttempts, 1719 StatesRemovedByMinimization, 64 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 56.5s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1057 ConstructedInterpolants, 0 QuantifiedInterpolants, 20824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 81 InterpolantComputations, 81 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 20:49:05,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3a6c5d-6cb2-4de6-806b-2b35ab4af785/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE